/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_LAZY.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:55:25,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:55:25,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:55:25,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:55:25,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:55:25,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:55:25,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:55:25,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:55:25,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:55:25,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:55:25,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:55:25,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:55:25,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:55:25,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:55:25,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:55:25,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:55:25,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:55:25,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:55:25,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:55:25,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:55:25,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:55:25,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:55:25,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:55:25,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:55:25,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:55:25,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:55:25,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:55:25,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:55:25,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:55:25,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:55:25,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:55:25,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:55:25,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:55:25,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:55:25,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:55:25,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:55:25,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:55:25,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:55:25,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:55:25,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:55:25,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:55:25,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:55:25,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:55:25,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:55:25,681 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:55:25,681 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:55:25,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:55:25,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:55:25,682 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:55:25,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:55:25,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:55:25,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:55:25,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:55:25,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:55:25,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:55:25,683 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:55:25,683 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:55:25,684 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:55:25,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:55:25,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:55:25,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:55:25,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:55:25,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:55:25,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:55:25,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:55:25,686 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:55:25,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:55:25,686 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:55:25,686 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 17:55:25,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:55:25,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:55:25,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:55:25,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:55:25,911 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:55:25,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_productSimulator.cil.c [2022-01-10 17:55:25,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670d45130/6e02b4a05b014817ac538cee82c3df5c/FLAG8a06f582a [2022-01-10 17:55:26,404 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:55:26,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_productSimulator.cil.c [2022-01-10 17:55:26,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670d45130/6e02b4a05b014817ac538cee82c3df5c/FLAG8a06f582a [2022-01-10 17:55:26,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670d45130/6e02b4a05b014817ac538cee82c3df5c [2022-01-10 17:55:26,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:55:26,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:55:26,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:55:26,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:55:26,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:55:26,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:55:26" (1/1) ... [2022-01-10 17:55:26,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c7255f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:26, skipping insertion in model container [2022-01-10 17:55:26,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:55:26" (1/1) ... [2022-01-10 17:55:26,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:55:26,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:55:26,719 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_spec1_productSimulator.cil.c[12839,12852] [2022-01-10 17:55:26,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:55:26,899 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 17:55:26,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:55:26,945 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_spec1_productSimulator.cil.c[12839,12852] [2022-01-10 17:55:27,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:55:27,011 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:55:27,041 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_spec1_productSimulator.cil.c[12839,12852] [2022-01-10 17:55:27,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:55:27,114 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:55:27,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27 WrapperNode [2022-01-10 17:55:27,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:55:27,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:55:27,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:55:27,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:55:27,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:27,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:27,615 INFO L137 Inliner]: procedures = 112, calls = 383, calls flagged for inlining = 235, calls inlined = 2519, statements flattened = 81145 [2022-01-10 17:55:27,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:55:27,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:55:27,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:55:27,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:55:27,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:27,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:27,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:27,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:28,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:28,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:28,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:28,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:55:28,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:55:28,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:55:28,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:55:28,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (1/1) ... [2022-01-10 17:55:28,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:55:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:55:29,021 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 17:55:29,074 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 17:55:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:55:29,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:55:29,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:55:29,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:55:29,316 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:55:29,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:55:50,867 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint getCurrentFloorID_returnLabel#42: __utac_acc__Specification1_spec__3_#t~ret33#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification1_spec__3_~tmp~4#1 := __utac_acc__Specification1_spec__3_#t~ret33#1;havoc __utac_acc__Specification1_spec__3_#t~ret33#1;__utac_acc__Specification1_spec__3_~floor~0#1 := __utac_acc__Specification1_spec__3_~tmp~4#1; [2022-01-10 17:55:50,867 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint getCurrentFloorID_returnLabel#21: __utac_acc__Specification1_spec__3_#t~ret33#1 := getCurrentFloorID_#res#1;assume { :end_inline_getCurrentFloorID } true;__utac_acc__Specification1_spec__3_~tmp~4#1 := __utac_acc__Specification1_spec__3_#t~ret33#1;havoc __utac_acc__Specification1_spec__3_#t~ret33#1;__utac_acc__Specification1_spec__3_~floor~0#1 := __utac_acc__Specification1_spec__3_~tmp~4#1; [2022-01-10 17:55:50,867 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L583-2: assume 0bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,867 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L583-2: assume !(0bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,868 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L583-5: assume 0bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,868 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L583-5: assume !(0bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,868 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L584-2: assume 0bv32 != ~landingButtons_spc1_0~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,868 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L584-2: assume !(0bv32 != ~landingButtons_spc1_0~0); [2022-01-10 17:55:50,869 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L584-5: assume 0bv32 != ~landingButtons_spc1_0~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,869 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L584-5: assume !(0bv32 != ~landingButtons_spc1_0~0); [2022-01-10 17:55:50,869 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L588-4: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___4~0#1;~landingButtons_spc1_0~0 := 0bv32; [2022-01-10 17:55:50,869 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L588-4: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___4~0#1); [2022-01-10 17:55:50,869 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L588-10: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___4~0#1;~landingButtons_spc1_0~0 := 0bv32; [2022-01-10 17:55:50,869 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L588-10: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___4~0#1); [2022-01-10 17:55:50,869 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L597-2: assume 1bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L597-2: assume !(1bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L597-5: assume 1bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L597-5: assume !(1bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L599-2: assume 0bv32 != ~landingButtons_spc1_1~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L599-2: assume !(0bv32 != ~landingButtons_spc1_1~0); [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L599-5: assume 0bv32 != ~landingButtons_spc1_1~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L599-5: assume !(0bv32 != ~landingButtons_spc1_1~0); [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L603-4: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___3~0#1;~landingButtons_spc1_1~0 := 0bv32; [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L603-4: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___3~0#1); [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L603-10: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___3~0#1;~landingButtons_spc1_1~0 := 0bv32; [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L603-10: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___3~0#1); [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L612-2: assume 2bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,870 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L612-2: assume !(2bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L612-5: assume 2bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L612-5: assume !(2bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L614-2: assume 0bv32 != ~landingButtons_spc1_2~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L614-2: assume !(0bv32 != ~landingButtons_spc1_2~0); [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L614-5: assume 0bv32 != ~landingButtons_spc1_2~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L614-5: assume !(0bv32 != ~landingButtons_spc1_2~0); [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L618-4: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___2~0#1;~landingButtons_spc1_2~0 := 0bv32; [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L618-4: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___2~0#1); [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L618-10: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___2~0#1;~landingButtons_spc1_2~0 := 0bv32; [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L618-10: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___2~0#1); [2022-01-10 17:55:50,871 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L627-2: assume 3bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,872 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L627-2: assume !(3bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,872 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L627-5: assume 3bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,872 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L627-5: assume !(3bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,872 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L629-2: assume 0bv32 != ~landingButtons_spc1_3~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,872 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L629-2: assume !(0bv32 != ~landingButtons_spc1_3~0); [2022-01-10 17:55:50,872 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L629-5: assume 0bv32 != ~landingButtons_spc1_3~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,872 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L629-5: assume !(0bv32 != ~landingButtons_spc1_3~0); [2022-01-10 17:55:50,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-4: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___1~0#1;~landingButtons_spc1_3~0 := 0bv32; [2022-01-10 17:55:50,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-4: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___1~0#1); [2022-01-10 17:55:50,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-10: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___1~0#1;~landingButtons_spc1_3~0 := 0bv32; [2022-01-10 17:55:50,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L633-10: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___1~0#1); [2022-01-10 17:55:50,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L642-2: assume 4bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L642-2: assume !(4bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L642-5: assume 4bv32 == __utac_acc__Specification1_spec__3_~floor~0#1; [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L642-5: assume !(4bv32 == __utac_acc__Specification1_spec__3_~floor~0#1); [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L643-2: assume { :end_inline___utac_acc__Specification1_spec__3 } true; [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L643-5: assume { :end_inline___utac_acc__Specification1_spec__3 } true; [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L644-4: assume 0bv32 != ~landingButtons_spc1_4~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L644-4: assume !(0bv32 != ~landingButtons_spc1_4~0); [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L644-10: assume 0bv32 != ~landingButtons_spc1_4~0;assume { :begin_inline_areDoorsOpen } true;havoc areDoorsOpen_#res#1;havoc areDoorsOpen_~retValue_acc~12#1;havoc areDoorsOpen_~retValue_acc~12#1;areDoorsOpen_~retValue_acc~12#1 := ~doorState~0;areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L644-10: assume !(0bv32 != ~landingButtons_spc1_4~0); [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L648-6: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___0~0#1;~landingButtons_spc1_4~0 := 0bv32; [2022-01-10 17:55:50,874 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L648-6: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___0~0#1); [2022-01-10 17:55:50,879 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L648-15: assume 0bv32 != __utac_acc__Specification1_spec__3_~tmp___0~0#1;~landingButtons_spc1_4~0 := 0bv32; [2022-01-10 17:55:50,879 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L648-15: assume !(0bv32 != __utac_acc__Specification1_spec__3_~tmp___0~0#1); [2022-01-10 17:55:50,885 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-11: __utac_acc__Specification1_spec__3_#t~ret34#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___4~0#1 := __utac_acc__Specification1_spec__3_#t~ret34#1;havoc __utac_acc__Specification1_spec__3_#t~ret34#1; [2022-01-10 17:55:50,885 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-12: __utac_acc__Specification1_spec__3_#t~ret35#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___3~0#1 := __utac_acc__Specification1_spec__3_#t~ret35#1;havoc __utac_acc__Specification1_spec__3_#t~ret35#1; [2022-01-10 17:55:50,885 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-13: __utac_acc__Specification1_spec__3_#t~ret36#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___2~0#1 := __utac_acc__Specification1_spec__3_#t~ret36#1;havoc __utac_acc__Specification1_spec__3_#t~ret36#1; [2022-01-10 17:55:50,885 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-14: __utac_acc__Specification1_spec__3_#t~ret37#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___1~0#1 := __utac_acc__Specification1_spec__3_#t~ret37#1;havoc __utac_acc__Specification1_spec__3_#t~ret37#1; [2022-01-10 17:55:50,886 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-15: __utac_acc__Specification1_spec__3_#t~ret38#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___0~0#1 := __utac_acc__Specification1_spec__3_#t~ret38#1;havoc __utac_acc__Specification1_spec__3_#t~ret38#1; [2022-01-10 17:55:50,886 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-27: __utac_acc__Specification1_spec__3_#t~ret34#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___4~0#1 := __utac_acc__Specification1_spec__3_#t~ret34#1;havoc __utac_acc__Specification1_spec__3_#t~ret34#1; [2022-01-10 17:55:50,886 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-28: __utac_acc__Specification1_spec__3_#t~ret35#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___3~0#1 := __utac_acc__Specification1_spec__3_#t~ret35#1;havoc __utac_acc__Specification1_spec__3_#t~ret35#1; [2022-01-10 17:55:50,886 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-29: __utac_acc__Specification1_spec__3_#t~ret36#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___2~0#1 := __utac_acc__Specification1_spec__3_#t~ret36#1;havoc __utac_acc__Specification1_spec__3_#t~ret36#1; [2022-01-10 17:55:50,886 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-30: __utac_acc__Specification1_spec__3_#t~ret37#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___1~0#1 := __utac_acc__Specification1_spec__3_#t~ret37#1;havoc __utac_acc__Specification1_spec__3_#t~ret37#1; [2022-01-10 17:55:50,886 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717-31: __utac_acc__Specification1_spec__3_#t~ret38#1 := areDoorsOpen_#res#1;assume { :end_inline_areDoorsOpen } true;__utac_acc__Specification1_spec__3_~tmp___0~0#1 := __utac_acc__Specification1_spec__3_#t~ret38#1;havoc __utac_acc__Specification1_spec__3_#t~ret38#1; [2022-01-10 17:55:50,890 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:55:50,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:55:50,964 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 17:55:50,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:55:50 BoogieIcfgContainer [2022-01-10 17:55:50,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:55:50,982 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:55:50,982 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:55:50,983 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:55:50,985 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:55:50" (1/1) ... [2022-01-10 17:55:54,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:55:54 BasicIcfg [2022-01-10 17:55:54,293 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:55:54,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:55:54,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:55:54,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:55:54,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:55:26" (1/4) ... [2022-01-10 17:55:54,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c5cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:55:54, skipping insertion in model container [2022-01-10 17:55:54,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:55:27" (2/4) ... [2022-01-10 17:55:54,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c5cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:55:54, skipping insertion in model container [2022-01-10 17:55:54,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:55:50" (3/4) ... [2022-01-10 17:55:54,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c5cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:55:54, skipping insertion in model container [2022-01-10 17:55:54,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:55:54" (4/4) ... [2022-01-10 17:55:54,317 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_productSimulator.cil.cTransformedIcfg [2022-01-10 17:55:54,324 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:55:54,324 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-10 17:55:54,402 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:55:54,422 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 17:55:54,422 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-10 17:55:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 20521 states, 20515 states have (on average 1.8717036314891542) internal successors, (38398), 20520 states have internal predecessors, (38398), 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 17:55:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 17:55:54,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:55:54,668 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 17:55:54,668 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 17:55:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:55:54,672 INFO L85 PathProgramCache]: Analyzing trace with hash -540312504, now seen corresponding path program 1 times [2022-01-10 17:55:54,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:55:54,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302850040] [2022-01-10 17:55:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:55:54,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:55:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:55:55,017 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 17:55:55,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:55:55,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302850040] [2022-01-10 17:55:55,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302850040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:55:55,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:55:55,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:55:55,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613686016] [2022-01-10 17:55:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:55:55,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:55:55,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:55:55,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:55:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:55:55,143 INFO L87 Difference]: Start difference. First operand has 20521 states, 20515 states have (on average 1.8717036314891542) internal successors, (38398), 20520 states have internal predecessors, (38398), 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 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 17:55:56,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:55:56,577 INFO L93 Difference]: Finished difference Result 61446 states and 115002 transitions. [2022-01-10 17:55:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:55:56,580 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 17:55:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:55:56,757 INFO L225 Difference]: With dead ends: 61446 [2022-01-10 17:55:56,758 INFO L226 Difference]: Without dead ends: 40938 [2022-01-10 17:55:56,806 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 17:55:56,809 INFO L933 BasicCegarLoop]: 76615 mSDtfsCounter, 38343 mSDsluCounter, 38265 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38343 SdHoareTripleChecker+Valid, 114880 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:55:56,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38343 Valid, 114880 Invalid, 24 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:55:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40938 states. [2022-01-10 17:55:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40938 to 20510. [2022-01-10 17:55:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20510 states, 20505 states have (on average 1.8714459887832235) internal successors, (38374), 20509 states have internal predecessors, (38374), 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 17:55:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20510 states to 20510 states and 38374 transitions. [2022-01-10 17:55:57,687 INFO L78 Accepts]: Start accepts. Automaton has 20510 states and 38374 transitions. Word has length 55 [2022-01-10 17:55:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:55:57,688 INFO L470 AbstractCegarLoop]: Abstraction has 20510 states and 38374 transitions. [2022-01-10 17:55:57,689 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 17:55:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20510 states and 38374 transitions. [2022-01-10 17:55:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 17:55:57,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:55:57,694 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, 1, 1, 1, 1, 1] [2022-01-10 17:55:57,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:55:57,695 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 17:55:57,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:55:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1674829170, now seen corresponding path program 1 times [2022-01-10 17:55:57,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:55:57,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238542000] [2022-01-10 17:55:57,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:55:57,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:55:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:55:57,818 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 17:55:57,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:55:57,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238542000] [2022-01-10 17:55:57,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238542000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:55:57,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:55:57,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:55:57,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248276970] [2022-01-10 17:55:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:55:57,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:55:57,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:55:57,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:55:57,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:55:57,828 INFO L87 Difference]: Start difference. First operand 20510 states and 38374 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 17:55:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:55:59,090 INFO L93 Difference]: Finished difference Result 61351 states and 114810 transitions. [2022-01-10 17:55:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:55:59,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2022-01-10 17:55:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:55:59,210 INFO L225 Difference]: With dead ends: 61351 [2022-01-10 17:55:59,210 INFO L226 Difference]: Without dead ends: 40902 [2022-01-10 17:55:59,255 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 17:55:59,256 INFO L933 BasicCegarLoop]: 76478 mSDtfsCounter, 38245 mSDsluCounter, 38205 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38245 SdHoareTripleChecker+Valid, 114683 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:55:59,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38245 Valid, 114683 Invalid, 120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:55:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40902 states. [2022-01-10 17:55:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40902 to 20510. [2022-01-10 17:55:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20510 states, 20505 states have (on average 1.8702267739575713) internal successors, (38349), 20509 states have internal predecessors, (38349), 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 17:55:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20510 states to 20510 states and 38349 transitions. [2022-01-10 17:55:59,953 INFO L78 Accepts]: Start accepts. Automaton has 20510 states and 38349 transitions. Word has length 62 [2022-01-10 17:55:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:55:59,953 INFO L470 AbstractCegarLoop]: Abstraction has 20510 states and 38349 transitions. [2022-01-10 17:55:59,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 17:55:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20510 states and 38349 transitions. [2022-01-10 17:55:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 17:55:59,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:55:59,956 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:55:59,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:55:59,956 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 17:55:59,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:55:59,957 INFO L85 PathProgramCache]: Analyzing trace with hash -256030623, now seen corresponding path program 1 times [2022-01-10 17:55:59,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:55:59,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067581731] [2022-01-10 17:55:59,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:55:59,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:55:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:56:00,040 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 17:56:00,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:56:00,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067581731] [2022-01-10 17:56:00,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067581731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:56:00,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:56:00,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:56:00,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590099395] [2022-01-10 17:56:00,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:56:00,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:56:00,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:56:00,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:56:00,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:56:00,043 INFO L87 Difference]: Start difference. First operand 20510 states and 38349 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 17:56:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:56:00,638 INFO L93 Difference]: Finished difference Result 40938 states and 76584 transitions. [2022-01-10 17:56:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:56:00,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2022-01-10 17:56:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:56:00,689 INFO L225 Difference]: With dead ends: 40938 [2022-01-10 17:56:00,690 INFO L226 Difference]: Without dead ends: 20510 [2022-01-10 17:56:00,719 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 17:56:00,720 INFO L933 BasicCegarLoop]: 38330 mSDtfsCounter, 38322 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38322 SdHoareTripleChecker+Valid, 38353 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:56:00,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38322 Valid, 38353 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:56:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20510 states. [2022-01-10 17:56:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20510 to 20510. [2022-01-10 17:56:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20510 states, 20505 states have (on average 1.8701292367715192) internal successors, (38347), 20509 states have internal predecessors, (38347), 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 17:56:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20510 states to 20510 states and 38347 transitions. [2022-01-10 17:56:01,170 INFO L78 Accepts]: Start accepts. Automaton has 20510 states and 38347 transitions. Word has length 65 [2022-01-10 17:56:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:56:01,171 INFO L470 AbstractCegarLoop]: Abstraction has 20510 states and 38347 transitions. [2022-01-10 17:56:01,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 17:56:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20510 states and 38347 transitions. [2022-01-10 17:56:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 17:56:01,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:56:01,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:56:01,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:56:01,174 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 17:56:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:56:01,174 INFO L85 PathProgramCache]: Analyzing trace with hash -349132293, now seen corresponding path program 1 times [2022-01-10 17:56:01,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:56:01,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97278716] [2022-01-10 17:56:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:56:01,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:56:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:56:01,258 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 17:56:01,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:56:01,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97278716] [2022-01-10 17:56:01,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97278716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:56:01,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:56:01,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:56:01,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083471882] [2022-01-10 17:56:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:56:01,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:56:01,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:56:01,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:56:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:56:01,260 INFO L87 Difference]: Start difference. First operand 20510 states and 38347 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 17:56:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:56:01,795 INFO L93 Difference]: Finished difference Result 40902 states and 76511 transitions. [2022-01-10 17:56:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:56:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2022-01-10 17:56:01,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:56:01,837 INFO L225 Difference]: With dead ends: 40902 [2022-01-10 17:56:01,837 INFO L226 Difference]: Without dead ends: 20510 [2022-01-10 17:56:01,867 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 17:56:01,874 INFO L933 BasicCegarLoop]: 38252 mSDtfsCounter, 38303 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38303 SdHoareTripleChecker+Valid, 38283 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:56:01,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38303 Valid, 38283 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:56:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20510 states. [2022-01-10 17:56:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20510 to 20510. [2022-01-10 17:56:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20510 states, 20505 states have (on average 1.8696415508412583) internal successors, (38337), 20509 states have internal predecessors, (38337), 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 17:56:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20510 states to 20510 states and 38337 transitions. [2022-01-10 17:56:02,419 INFO L78 Accepts]: Start accepts. Automaton has 20510 states and 38337 transitions. Word has length 67 [2022-01-10 17:56:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:56:02,419 INFO L470 AbstractCegarLoop]: Abstraction has 20510 states and 38337 transitions. [2022-01-10 17:56:02,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 17:56:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 20510 states and 38337 transitions. [2022-01-10 17:56:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 17:56:02,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:56:02,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:56:02,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:56:02,422 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 17:56:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:56:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash 407128005, now seen corresponding path program 1 times [2022-01-10 17:56:02,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:56:02,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707407814] [2022-01-10 17:56:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:56:02,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:56:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:56:02,477 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 17:56:02,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:56:02,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707407814] [2022-01-10 17:56:02,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707407814] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:56:02,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:56:02,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:56:02,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061913070] [2022-01-10 17:56:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:56:02,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:56:02,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:56:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:56:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:56:02,479 INFO L87 Difference]: Start difference. First operand 20510 states and 38337 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 17:56:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:56:03,387 INFO L93 Difference]: Finished difference Result 51193 states and 95750 transitions. [2022-01-10 17:56:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:56:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2022-01-10 17:56:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:56:03,477 INFO L225 Difference]: With dead ends: 51193 [2022-01-10 17:56:03,477 INFO L226 Difference]: Without dead ends: 40931 [2022-01-10 17:56:03,501 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 17:56:03,502 INFO L933 BasicCegarLoop]: 57447 mSDtfsCounter, 38306 mSDsluCounter, 38223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38306 SdHoareTripleChecker+Valid, 95670 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:56:03,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38306 Valid, 95670 Invalid, 27 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 17:56:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40931 states. [2022-01-10 17:56:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40931 to 40931. [2022-01-10 17:56:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40931 states, 40926 states have (on average 1.870620143673948) internal successors, (76557), 40930 states have internal predecessors, (76557), 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 17:56:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40931 states to 40931 states and 76557 transitions. [2022-01-10 17:56:04,451 INFO L78 Accepts]: Start accepts. Automaton has 40931 states and 76557 transitions. Word has length 69 [2022-01-10 17:56:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:56:04,451 INFO L470 AbstractCegarLoop]: Abstraction has 40931 states and 76557 transitions. [2022-01-10 17:56:04,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 17:56:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 40931 states and 76557 transitions. [2022-01-10 17:56:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 17:56:04,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:56:04,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:56:04,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 17:56:04,456 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 17:56:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:56:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1217119044, now seen corresponding path program 1 times [2022-01-10 17:56:04,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:56:04,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340412599] [2022-01-10 17:56:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:56:04,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:56:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:56:04,511 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 17:56:04,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:56:04,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340412599] [2022-01-10 17:56:04,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340412599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:56:04,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:56:04,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:56:04,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93744474] [2022-01-10 17:56:04,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:56:04,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:56:04,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:56:04,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:56:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:56:04,513 INFO L87 Difference]: Start difference. First operand 40931 states and 76557 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 17:56:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:56:05,809 INFO L93 Difference]: Finished difference Result 102201 states and 191224 transitions. [2022-01-10 17:56:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:56:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-01-10 17:56:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:56:06,021 INFO L225 Difference]: With dead ends: 102201 [2022-01-10 17:56:06,021 INFO L226 Difference]: Without dead ends: 81711 [2022-01-10 17:56:06,061 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 17:56:06,061 INFO L933 BasicCegarLoop]: 38332 mSDtfsCounter, 38272 mSDsluCounter, 38226 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38272 SdHoareTripleChecker+Valid, 76558 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:56:06,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38272 Valid, 76558 Invalid, 26 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:56:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81711 states. [2022-01-10 17:56:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81711 to 81709. [2022-01-10 17:56:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81709 states, 81704 states have (on average 1.8712302947224126) internal successors, (152887), 81708 states have internal predecessors, (152887), 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 17:56:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81709 states to 81709 states and 152887 transitions. [2022-01-10 17:56:07,809 INFO L78 Accepts]: Start accepts. Automaton has 81709 states and 152887 transitions. Word has length 70 [2022-01-10 17:56:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:56:07,810 INFO L470 AbstractCegarLoop]: Abstraction has 81709 states and 152887 transitions. [2022-01-10 17:56:07,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 17:56:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 81709 states and 152887 transitions. [2022-01-10 17:56:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 17:56:07,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:56:07,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:56:07,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 17:56:07,817 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 17:56:07,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:56:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash -900225768, now seen corresponding path program 1 times [2022-01-10 17:56:07,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:56:07,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700828609] [2022-01-10 17:56:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:56:07,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:56:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:56:07,895 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 17:56:07,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:56:07,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700828609] [2022-01-10 17:56:07,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700828609] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:56:07,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:56:07,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 17:56:07,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223964992] [2022-01-10 17:56:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:56:07,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 17:56:07,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:56:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 17:56:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:56:07,897 INFO L87 Difference]: Start difference. First operand 81709 states and 152887 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 17:56:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:56:09,656 INFO L93 Difference]: Finished difference Result 163404 states and 305755 transitions. [2022-01-10 17:56:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:56:09,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 70 [2022-01-10 17:56:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:56:09,829 INFO L225 Difference]: With dead ends: 163404 [2022-01-10 17:56:09,829 INFO L226 Difference]: Without dead ends: 81709 [2022-01-10 17:56:09,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:56:09,903 INFO L933 BasicCegarLoop]: 38335 mSDtfsCounter, 3 mSDsluCounter, 114998 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 153333 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:56:09,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 153333 Invalid, 14 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:56:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81709 states. [2022-01-10 17:56:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81709 to 81709. [2022-01-10 17:56:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81709 states, 81704 states have (on average 1.8711935768138648) internal successors, (152884), 81708 states have internal predecessors, (152884), 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 17:56:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81709 states to 81709 states and 152884 transitions. [2022-01-10 17:56:11,759 INFO L78 Accepts]: Start accepts. Automaton has 81709 states and 152884 transitions. Word has length 70 [2022-01-10 17:56:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:56:11,759 INFO L470 AbstractCegarLoop]: Abstraction has 81709 states and 152884 transitions. [2022-01-10 17:56:11,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 17:56:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 81709 states and 152884 transitions. [2022-01-10 17:56:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 17:56:11,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:56:11,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:56:11,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 17:56:11,765 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 17:56:11,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:56:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1888488234, now seen corresponding path program 1 times [2022-01-10 17:56:11,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:56:11,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163724779] [2022-01-10 17:56:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:56:11,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:56:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:56:11,826 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 17:56:11,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:56:11,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163724779] [2022-01-10 17:56:11,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163724779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:56:11,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:56:11,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:56:11,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992932781] [2022-01-10 17:56:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:56:11,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:56:11,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:56:11,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:56:11,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:56:11,827 INFO L87 Difference]: Start difference. First operand 81709 states and 152884 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 17:56:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:56:13,149 INFO L93 Difference]: Finished difference Result 150094 states and 280779 transitions. [2022-01-10 17:56:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:56:13,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2022-01-10 17:56:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:56:13,310 INFO L225 Difference]: With dead ends: 150094 [2022-01-10 17:56:13,310 INFO L226 Difference]: Without dead ends: 82215 [2022-01-10 17:56:13,375 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 17:56:13,376 INFO L933 BasicCegarLoop]: 38354 mSDtfsCounter, 12952 mSDsluCounter, 25621 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12952 SdHoareTripleChecker+Valid, 63975 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:56:13,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12952 Valid, 63975 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:56:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82215 states. [2022-01-10 17:56:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82215 to 82188. [2022-01-10 17:56:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82188 states, 82183 states have (on average 1.8698392611610675) internal successors, (153669), 82187 states have internal predecessors, (153669), 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 17:56:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82188 states to 82188 states and 153669 transitions. [2022-01-10 17:56:15,119 INFO L78 Accepts]: Start accepts. Automaton has 82188 states and 153669 transitions. Word has length 71 [2022-01-10 17:56:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:56:15,119 INFO L470 AbstractCegarLoop]: Abstraction has 82188 states and 153669 transitions. [2022-01-10 17:56:15,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 17:56:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 82188 states and 153669 transitions. [2022-01-10 17:56:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 17:56:15,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:56:15,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:56:15,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 17:56:15,126 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 17:56:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:56:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2026268171, now seen corresponding path program 1 times [2022-01-10 17:56:15,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:56:15,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426604684] [2022-01-10 17:56:15,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:56:15,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:56:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:56:15,412 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 17:56:15,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:56:15,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426604684] [2022-01-10 17:56:15,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426604684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:56:15,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:56:15,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 17:56:15,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570843127] [2022-01-10 17:56:15,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:56:15,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 17:56:15,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:56:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 17:56:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:56:15,414 INFO L87 Difference]: Start difference. First operand 82188 states and 153669 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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)