/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:46:32,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:46:32,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:46:32,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:46:32,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:46:32,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:46:32,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:46:32,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:46:32,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:46:32,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:46:32,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:46:32,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:46:32,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:46:32,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:46:32,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:46:32,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:46:32,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:46:32,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:46:32,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:46:32,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:46:32,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:46:32,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:46:32,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:46:32,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:46:32,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:46:32,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:46:32,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:46:32,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:46:32,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:46:32,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:46:32,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:46:32,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:46:32,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:46:32,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:46:32,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:46:32,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:46:32,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:46:32,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:46:32,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:46:32,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:46:32,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:46:32,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:46:32,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:46:32,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:46:32,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:46:32,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:46:32,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:46:32,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:46:32,754 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:46:32,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:46:32,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:46:32,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:46:32,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:46:32,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:46:32,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:46:32,755 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:46:32,755 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:46:32,756 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:46:32,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:46:32,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:46:32,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:46:32,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:46:32,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:46:32,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:46:32,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:46:32,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:46:32,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:46:32,758 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:46:32,758 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:46:32,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:46:32,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:46:32,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:46:32,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:46:32,968 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:46:32,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2022-01-10 23:46:33,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a043a9099/e22ebfe94e3146619e1e4e82c6f1599d/FLAG90fb5ce23 [2022-01-10 23:46:33,482 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:46:33,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2022-01-10 23:46:33,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a043a9099/e22ebfe94e3146619e1e4e82c6f1599d/FLAG90fb5ce23 [2022-01-10 23:46:33,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a043a9099/e22ebfe94e3146619e1e4e82c6f1599d [2022-01-10 23:46:33,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:46:33,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:46:33,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:46:33,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:46:33,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:46:33,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:46:33" (1/1) ... [2022-01-10 23:46:33,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190f3250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:33, skipping insertion in model container [2022-01-10 23:46:33,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:46:33" (1/1) ... [2022-01-10 23:46:33,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:46:33,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:46:34,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c[4370,4383] [2022-01-10 23:46:34,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:46:34,267 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 23:46:34,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:46:34,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c[4370,4383] [2022-01-10 23:46:34,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:46:34,338 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:46:34,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c[4370,4383] [2022-01-10 23:46:34,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:46:34,407 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:46:34,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34 WrapperNode [2022-01-10 23:46:34,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:46:34,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:46:34,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:46:34,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:46:34,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:34,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:35,164 INFO L137 Inliner]: procedures = 112, calls = 382, calls flagged for inlining = 234, calls inlined = 2549, statements flattened = 81536 [2022-01-10 23:46:35,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:46:35,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:46:35,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:46:35,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:46:35,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:35,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:35,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:35,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:35,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:36,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:36,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:36,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:46:36,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:46:36,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:46:36,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:46:36,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (1/1) ... [2022-01-10 23:46:36,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:46:36,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:46:36,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:46:36,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:46:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:46:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:46:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:46:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:46:36,761 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:46:36,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:46:57,204 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint getCurrentFloorID_returnLabel#42: __utac_acc__Specification2_spec__3_#t~ret10#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification2_spec__3_~tmp~2#1 := __utac_acc__Specification2_spec__3_#t~ret10#1;havoc __utac_acc__Specification2_spec__3_#t~ret10#1;__utac_acc__Specification2_spec__3_~floor~0#1 := __utac_acc__Specification2_spec__3_~tmp~2#1; [2022-01-10 23:46:57,204 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint getCurrentFloorID_returnLabel#21: __utac_acc__Specification2_spec__3_#t~ret10#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification2_spec__3_~tmp~2#1 := __utac_acc__Specification2_spec__3_#t~ret10#1;havoc __utac_acc__Specification2_spec__3_#t~ret10#1;__utac_acc__Specification2_spec__3_~floor~0#1 := __utac_acc__Specification2_spec__3_~tmp~2#1; [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-2: assume 0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-2: assume !(0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-5: assume 0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1016-5: assume !(0bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: assume 0bv32 != ~floorButtons_spc2_0~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-2: assume !(0bv32 != ~floorButtons_spc2_0~0); [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-5: assume 0bv32 != ~floorButtons_spc2_0~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,206 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1017-5: assume !(0bv32 != ~floorButtons_spc2_0~0); [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1;~floorButtons_spc2_0~0 := 0bv32; [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1); [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1;~floorButtons_spc2_0~0 := 0bv32; [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___4~0#1); [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-2: assume 1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-2: assume !(1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-5: assume 1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030-5: assume !(1bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: assume 0bv32 != ~floorButtons_spc2_1~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,207 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-2: assume !(0bv32 != ~floorButtons_spc2_1~0); [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-5: assume 0bv32 != ~floorButtons_spc2_1~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-5: assume !(0bv32 != ~floorButtons_spc2_1~0); [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1;~floorButtons_spc2_1~0 := 0bv32; [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1); [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1;~floorButtons_spc2_1~0 := 0bv32; [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___3~0#1); [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-2: assume 2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-2: assume !(2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-5: assume 2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045-5: assume !(2bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-2: assume 0bv32 != ~floorButtons_spc2_2~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,208 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-2: assume !(0bv32 != ~floorButtons_spc2_2~0); [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-5: assume 0bv32 != ~floorButtons_spc2_2~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047-5: assume !(0bv32 != ~floorButtons_spc2_2~0); [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1;~floorButtons_spc2_2~0 := 0bv32; [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1); [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1;~floorButtons_spc2_2~0 := 0bv32; [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___2~0#1); [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-2: assume 3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-2: assume !(3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-5: assume 3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,209 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1060-5: assume !(3bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume 0bv32 != ~floorButtons_spc2_3~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-2: assume !(0bv32 != ~floorButtons_spc2_3~0); [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-5: assume 0bv32 != ~floorButtons_spc2_3~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062-5: assume !(0bv32 != ~floorButtons_spc2_3~0); [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-4: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1;~floorButtons_spc2_3~0 := 0bv32; [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-4: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1); [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-10: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1;~floorButtons_spc2_3~0 := 0bv32; [2022-01-10 23:46:57,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-10: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___1~2#1); [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-2: assume 4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-2: assume !(4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-5: assume 4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1; [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-5: assume !(4bv32 == __utac_acc__Specification2_spec__3_~floor~0#1); [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076-2: assume { :end_inline___utac_acc__Specification2_spec__3 } true; [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1076-5: assume { :end_inline___utac_acc__Specification2_spec__3 } true; [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-4: assume 0bv32 != ~floorButtons_spc2_4~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-4: assume !(0bv32 != ~floorButtons_spc2_4~0); [2022-01-10 23:46:57,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-10: assume 0bv32 != ~floorButtons_spc2_4~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~17#1;havoc areDoorsOpen_~retValue_acc~17#1;areDoorsOpen_~retValue_acc~17#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~17#1; [2022-01-10 23:46:57,212 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-10: assume !(0bv32 != ~floorButtons_spc2_4~0); [2022-01-10 23:46:57,212 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-6: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1;~floorButtons_spc2_4~0 := 0bv32; [2022-01-10 23:46:57,212 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-6: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1); [2022-01-10 23:46:57,216 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-15: assume 0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1;~floorButtons_spc2_4~0 := 0bv32; [2022-01-10 23:46:57,217 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1081-15: assume !(0bv32 != __utac_acc__Specification2_spec__3_~tmp___0~2#1); [2022-01-10 23:46:57,218 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-12: __utac_acc__Specification2_spec__3_#t~ret12#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___3~0#1 := __utac_acc__Specification2_spec__3_#t~ret12#1;havoc __utac_acc__Specification2_spec__3_#t~ret12#1; [2022-01-10 23:46:57,218 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-11: __utac_acc__Specification2_spec__3_#t~ret11#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___4~0#1 := __utac_acc__Specification2_spec__3_#t~ret11#1;havoc __utac_acc__Specification2_spec__3_#t~ret11#1; [2022-01-10 23:46:57,218 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-14: __utac_acc__Specification2_spec__3_#t~ret14#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___1~2#1 := __utac_acc__Specification2_spec__3_#t~ret14#1;havoc __utac_acc__Specification2_spec__3_#t~ret14#1; [2022-01-10 23:46:57,218 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-13: __utac_acc__Specification2_spec__3_#t~ret13#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___2~0#1 := __utac_acc__Specification2_spec__3_#t~ret13#1;havoc __utac_acc__Specification2_spec__3_#t~ret13#1; [2022-01-10 23:46:57,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-15: __utac_acc__Specification2_spec__3_#t~ret15#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___0~2#1 := __utac_acc__Specification2_spec__3_#t~ret15#1;havoc __utac_acc__Specification2_spec__3_#t~ret15#1; [2022-01-10 23:46:57,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-28: __utac_acc__Specification2_spec__3_#t~ret12#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___3~0#1 := __utac_acc__Specification2_spec__3_#t~ret12#1;havoc __utac_acc__Specification2_spec__3_#t~ret12#1; [2022-01-10 23:46:57,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-27: __utac_acc__Specification2_spec__3_#t~ret11#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___4~0#1 := __utac_acc__Specification2_spec__3_#t~ret11#1;havoc __utac_acc__Specification2_spec__3_#t~ret11#1; [2022-01-10 23:46:57,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-30: __utac_acc__Specification2_spec__3_#t~ret14#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___1~2#1 := __utac_acc__Specification2_spec__3_#t~ret14#1;havoc __utac_acc__Specification2_spec__3_#t~ret14#1; [2022-01-10 23:46:57,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-29: __utac_acc__Specification2_spec__3_#t~ret13#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___2~0#1 := __utac_acc__Specification2_spec__3_#t~ret13#1;havoc __utac_acc__Specification2_spec__3_#t~ret13#1; [2022-01-10 23:46:57,219 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276-31: __utac_acc__Specification2_spec__3_#t~ret15#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification2_spec__3_~tmp___0~2#1 := __utac_acc__Specification2_spec__3_#t~ret15#1;havoc __utac_acc__Specification2_spec__3_#t~ret15#1; [2022-01-10 23:46:57,222 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:46:57,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:46:57,295 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 23:46:57,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:46:57 BoogieIcfgContainer [2022-01-10 23:46:57,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:46:57,316 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:46:57,316 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:46:57,318 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:46:57,320 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:46:57" (1/1) ... [2022-01-10 23:47:00,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:47:00 BasicIcfg [2022-01-10 23:47:00,190 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:47:00,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:47:00,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:47:00,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:47:00,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:46:33" (1/4) ... [2022-01-10 23:47:00,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752f4bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:47:00, skipping insertion in model container [2022-01-10 23:47:00,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:46:34" (2/4) ... [2022-01-10 23:47:00,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752f4bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:47:00, skipping insertion in model container [2022-01-10 23:47:00,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:46:57" (3/4) ... [2022-01-10 23:47:00,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752f4bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:47:00, skipping insertion in model container [2022-01-10 23:47:00,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:47:00" (4/4) ... [2022-01-10 23:47:00,198 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec2_productSimulator.cil.cTransformedIcfg [2022-01-10 23:47:00,201 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:47:00,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-10 23:47:00,289 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:47:00,295 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:47:00,296 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-10 23:47:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 20674 states, 20668 states have (on average 1.8712502419198762) internal successors, (38675), 20673 states have internal predecessors, (38675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:47:00,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:47:00,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:47:00,632 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 23:47:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:47:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1203949540, now seen corresponding path program 1 times [2022-01-10 23:47:00,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:47:00,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134113559] [2022-01-10 23:47:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:47:00,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:47:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:47:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:47:00,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:47:00,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134113559] [2022-01-10 23:47:00,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134113559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:47:00,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:47:00,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:47:00,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124931058] [2022-01-10 23:47:00,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:47:01,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:47:01,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:47:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:47:01,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:01,094 INFO L87 Difference]: Start difference. First operand has 20674 states, 20668 states have (on average 1.8712502419198762) internal successors, (38675), 20673 states have internal predecessors, (38675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:47:02,705 INFO L93 Difference]: Finished difference Result 41322 states and 77311 transitions. [2022-01-10 23:47:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:47:02,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 23:47:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:47:02,916 INFO L225 Difference]: With dead ends: 41322 [2022-01-10 23:47:02,916 INFO L226 Difference]: Without dead ends: 20663 [2022-01-10 23:47:02,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:02,995 INFO L933 BasicCegarLoop]: 38654 mSDtfsCounter, 38633 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38633 SdHoareTripleChecker+Valid, 38681 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:47:02,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38633 Valid, 38681 Invalid, 11 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:47:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20663 states. [2022-01-10 23:47:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20663 to 20663. [2022-01-10 23:47:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20663 states, 20658 states have (on average 1.8709942879271952) internal successors, (38651), 20662 states have internal predecessors, (38651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20663 states to 20663 states and 38651 transitions. [2022-01-10 23:47:03,886 INFO L78 Accepts]: Start accepts. Automaton has 20663 states and 38651 transitions. Word has length 42 [2022-01-10 23:47:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:47:03,887 INFO L470 AbstractCegarLoop]: Abstraction has 20663 states and 38651 transitions. [2022-01-10 23:47:03,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 20663 states and 38651 transitions. [2022-01-10 23:47:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 23:47:03,891 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:47:03,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:47:03,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:47:03,892 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 23:47:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:47:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash 528971934, now seen corresponding path program 1 times [2022-01-10 23:47:03,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:47:03,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319959695] [2022-01-10 23:47:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:47:03,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:47:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:47:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:47:04,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:47:04,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319959695] [2022-01-10 23:47:04,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319959695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:47:04,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:47:04,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:47:04,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099106988] [2022-01-10 23:47:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:47:04,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:47:04,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:47:04,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:47:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:04,019 INFO L87 Difference]: Start difference. First operand 20663 states and 38651 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:47:05,117 INFO L93 Difference]: Finished difference Result 41265 states and 77200 transitions. [2022-01-10 23:47:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:47:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-01-10 23:47:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:47:05,192 INFO L225 Difference]: With dead ends: 41265 [2022-01-10 23:47:05,192 INFO L226 Difference]: Without dead ends: 20663 [2022-01-10 23:47:05,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:05,219 INFO L933 BasicCegarLoop]: 38591 mSDtfsCounter, 38593 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38593 SdHoareTripleChecker+Valid, 38622 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:47:05,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38593 Valid, 38622 Invalid, 59 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:47:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20663 states. [2022-01-10 23:47:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20663 to 20663. [2022-01-10 23:47:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20663 states, 20658 states have (on average 1.8697841030109401) internal successors, (38626), 20662 states have internal predecessors, (38626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20663 states to 20663 states and 38626 transitions. [2022-01-10 23:47:05,731 INFO L78 Accepts]: Start accepts. Automaton has 20663 states and 38626 transitions. Word has length 49 [2022-01-10 23:47:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:47:05,731 INFO L470 AbstractCegarLoop]: Abstraction has 20663 states and 38626 transitions. [2022-01-10 23:47:05,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 20663 states and 38626 transitions. [2022-01-10 23:47:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 23:47:05,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:47:05,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:47:05,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:47:05,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 23:47:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:47:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 32260521, now seen corresponding path program 1 times [2022-01-10 23:47:05,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:47:05,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170357156] [2022-01-10 23:47:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:47:05,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:47:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:47:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:47:05,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:47:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170357156] [2022-01-10 23:47:05,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170357156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:47:05,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:47:05,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:47:05,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887148268] [2022-01-10 23:47:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:47:05,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:47:05,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:47:05,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:47:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:05,821 INFO L87 Difference]: Start difference. First operand 20663 states and 38626 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:47:06,827 INFO L93 Difference]: Finished difference Result 43401 states and 81165 transitions. [2022-01-10 23:47:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:47:06,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-10 23:47:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:47:06,904 INFO L225 Difference]: With dead ends: 43401 [2022-01-10 23:47:06,904 INFO L226 Difference]: Without dead ends: 33031 [2022-01-10 23:47:06,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:06,930 INFO L933 BasicCegarLoop]: 40601 mSDtfsCounter, 38545 mSDsluCounter, 23119 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38545 SdHoareTripleChecker+Valid, 63720 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:47:06,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38545 Valid, 63720 Invalid, 60 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:47:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33031 states. [2022-01-10 23:47:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33031 to 33031. [2022-01-10 23:47:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33031 states, 33026 states have (on average 1.870465693695876) internal successors, (61774), 33030 states have internal predecessors, (61774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33031 states to 33031 states and 61774 transitions. [2022-01-10 23:47:07,761 INFO L78 Accepts]: Start accepts. Automaton has 33031 states and 61774 transitions. Word has length 52 [2022-01-10 23:47:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:47:07,761 INFO L470 AbstractCegarLoop]: Abstraction has 33031 states and 61774 transitions. [2022-01-10 23:47:07,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 33031 states and 61774 transitions. [2022-01-10 23:47:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-10 23:47:07,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:47:07,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:47:07,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:47:07,766 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 23:47:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:47:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1607475959, now seen corresponding path program 1 times [2022-01-10 23:47:07,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:47:07,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366853466] [2022-01-10 23:47:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:47:07,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:47:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:47:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:47:07,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:47:07,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366853466] [2022-01-10 23:47:07,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366853466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:47:07,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:47:07,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:47:07,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059775647] [2022-01-10 23:47:07,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:47:07,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:47:07,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:47:07,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:47:07,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:07,842 INFO L87 Difference]: Start difference. First operand 33031 states and 61774 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:47:09,037 INFO L93 Difference]: Finished difference Result 78093 states and 146081 transitions. [2022-01-10 23:47:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:47:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-01-10 23:47:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:47:09,196 INFO L225 Difference]: With dead ends: 78093 [2022-01-10 23:47:09,196 INFO L226 Difference]: Without dead ends: 57387 [2022-01-10 23:47:09,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:09,244 INFO L933 BasicCegarLoop]: 38621 mSDtfsCounter, 38533 mSDsluCounter, 23122 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38533 SdHoareTripleChecker+Valid, 61743 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:47:09,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38533 Valid, 61743 Invalid, 60 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:47:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57387 states. [2022-01-10 23:47:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57387 to 57385. [2022-01-10 23:47:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57385 states, 57380 states have (on average 1.8708260718020215) internal successors, (107348), 57384 states have internal predecessors, (107348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57385 states to 57385 states and 107348 transitions. [2022-01-10 23:47:10,786 INFO L78 Accepts]: Start accepts. Automaton has 57385 states and 107348 transitions. Word has length 54 [2022-01-10 23:47:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:47:10,803 INFO L470 AbstractCegarLoop]: Abstraction has 57385 states and 107348 transitions. [2022-01-10 23:47:10,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 57385 states and 107348 transitions. [2022-01-10 23:47:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 23:47:10,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:47:10,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:47:10,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:47:10,807 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 23:47:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:47:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1707953104, now seen corresponding path program 1 times [2022-01-10 23:47:10,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:47:10,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016523057] [2022-01-10 23:47:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:47:10,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:47:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:47:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:47:10,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:47:10,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016523057] [2022-01-10 23:47:10,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016523057] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:47:10,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:47:10,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:47:10,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965135937] [2022-01-10 23:47:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:47:10,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:47:10,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:47:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:47:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:10,869 INFO L87 Difference]: Start difference. First operand 57385 states and 107348 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:47:12,430 INFO L93 Difference]: Finished difference Result 146691 states and 274432 transitions. [2022-01-10 23:47:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:47:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 23:47:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:47:12,716 INFO L225 Difference]: With dead ends: 146691 [2022-01-10 23:47:12,716 INFO L226 Difference]: Without dead ends: 105332 [2022-01-10 23:47:12,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:12,784 INFO L933 BasicCegarLoop]: 38621 mSDtfsCounter, 38532 mSDsluCounter, 23125 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38532 SdHoareTripleChecker+Valid, 61746 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:47:12,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38532 Valid, 61746 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:47:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105332 states. [2022-01-10 23:47:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105332 to 105328. [2022-01-10 23:47:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105328 states, 105323 states have (on average 1.8709113868765608) internal successors, (197050), 105327 states have internal predecessors, (197050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105328 states to 105328 states and 197050 transitions. [2022-01-10 23:47:15,435 INFO L78 Accepts]: Start accepts. Automaton has 105328 states and 197050 transitions. Word has length 55 [2022-01-10 23:47:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:47:15,435 INFO L470 AbstractCegarLoop]: Abstraction has 105328 states and 197050 transitions. [2022-01-10 23:47:15,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 105328 states and 197050 transitions. [2022-01-10 23:47:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 23:47:15,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:47:15,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:47:15,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 23:47:15,441 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 23:47:15,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:47:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1407039127, now seen corresponding path program 1 times [2022-01-10 23:47:15,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:47:15,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199249428] [2022-01-10 23:47:15,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:47:15,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:47:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:47:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:47:15,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:47:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199249428] [2022-01-10 23:47:15,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199249428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:47:15,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:47:15,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:47:15,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610112546] [2022-01-10 23:47:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:47:15,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:47:15,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:47:15,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:47:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:15,505 INFO L87 Difference]: Start difference. First operand 105328 states and 197050 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:47:18,640 INFO L93 Difference]: Finished difference Result 282315 states and 528169 transitions. [2022-01-10 23:47:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:47:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 23:47:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:47:19,254 INFO L225 Difference]: With dead ends: 282315 [2022-01-10 23:47:19,255 INFO L226 Difference]: Without dead ends: 199689 [2022-01-10 23:47:19,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:19,412 INFO L933 BasicCegarLoop]: 38621 mSDtfsCounter, 38531 mSDsluCounter, 23128 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38531 SdHoareTripleChecker+Valid, 61749 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:47:19,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38531 Valid, 61749 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:47:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199689 states. [2022-01-10 23:47:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199689 to 199683. [2022-01-10 23:47:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199683 states, 199678 states have (on average 1.8708120073318042) internal successors, (373560), 199682 states have internal predecessors, (373560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199683 states to 199683 states and 373560 transitions. [2022-01-10 23:47:24,050 INFO L78 Accepts]: Start accepts. Automaton has 199683 states and 373560 transitions. Word has length 56 [2022-01-10 23:47:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:47:24,051 INFO L470 AbstractCegarLoop]: Abstraction has 199683 states and 373560 transitions. [2022-01-10 23:47:24,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 199683 states and 373560 transitions. [2022-01-10 23:47:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 23:47:24,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:47:24,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:47:24,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 23:47:24,076 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 23:47:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:47:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 668640650, now seen corresponding path program 1 times [2022-01-10 23:47:24,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:47:24,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503458338] [2022-01-10 23:47:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:47:24,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:47:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:47:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:47:24,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:47:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503458338] [2022-01-10 23:47:24,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503458338] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:47:24,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:47:24,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:47:24,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600106204] [2022-01-10 23:47:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:47:24,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:47:24,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:47:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:47:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:47:24,137 INFO L87 Difference]: Start difference. First operand 199683 states and 373560 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:47:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:47:29,787 INFO L93 Difference]: Finished difference Result 550419 states and 1029709 transitions. [2022-01-10 23:47:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:47:29,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-01-10 23:47:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted.