./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ed4163e8f042a84d9cdccd4fee3ee0ba89fdce83cd991779acec4a51d9a650c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:30:06,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:30:06,579 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:30:06,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:30:06,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:30:06,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:30:06,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:30:06,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:30:06,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:30:06,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:30:06,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:30:06,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:30:06,655 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:30:06,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:30:06,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:30:06,658 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:30:06,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:30:06,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:30:06,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:30:06,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:30:06,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:30:06,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:30:06,661 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:30:06,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:30:06,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:30:06,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:30:06,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:30:06,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:30:06,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:06,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:30:06,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:30:06,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:30:06,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:30:06,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:30:06,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:30:06,668 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:30:06,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:30:06,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:30:06,668 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:30:06,669 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ed4163e8f042a84d9cdccd4fee3ee0ba89fdce83cd991779acec4a51d9a650c [2023-11-12 02:30:06,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:30:06,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:30:06,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:30:06,985 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:30:06,986 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:30:06,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c [2023-11-12 02:30:10,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:30:10,646 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:30:10,647 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c [2023-11-12 02:30:10,684 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/data/c71b5ecbf/2199657b77ac4a079c3b578360bb3f3f/FLAGb09e34c6c [2023-11-12 02:30:10,702 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/data/c71b5ecbf/2199657b77ac4a079c3b578360bb3f3f [2023-11-12 02:30:10,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:30:10,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:30:10,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:10,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:30:10,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:30:10,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49e02c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:10, skipping insertion in model container [2023-11-12 02:30:10,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:30:10" (1/1) ... [2023-11-12 02:30:10,818 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:30:11,431 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c[68958,68971] [2023-11-12 02:30:11,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:11,458 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:30:11,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2023-11-12 02:30:11,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [169] [2023-11-12 02:30:11,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [268] [2023-11-12 02:30:11,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [935] [2023-11-12 02:30:11,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [976] [2023-11-12 02:30:11,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [994] [2023-11-12 02:30:11,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1346] [2023-11-12 02:30:11,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1712] [2023-11-12 02:30:11,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1747] [2023-11-12 02:30:11,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3244] [2023-11-12 02:30:11,644 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/sv-benchmarks/c/product-lines/elevator_spec14_product03.cil.c[68958,68971] [2023-11-12 02:30:11,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:30:11,675 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:30:11,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11 WrapperNode [2023-11-12 02:30:11,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:30:11,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:11,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:30:11,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:30:11,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,782 INFO L138 Inliner]: procedures = 89, calls = 329, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 1002 [2023-11-12 02:30:11,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:30:11,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:30:11,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:30:11,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:30:11,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:30:11,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:30:11,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:30:11,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:30:11,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (1/1) ... [2023-11-12 02:30:11,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:30:11,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:30:11,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:30:11,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac32b02b-5f26-46d8-971a-179e05ac5aab/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:30:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:30:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2023-11-12 02:30:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2023-11-12 02:30:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2023-11-12 02:30:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2023-11-12 02:30:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2023-11-12 02:30:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2023-11-12 02:30:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2023-11-12 02:30:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2023-11-12 02:30:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2023-11-12 02:30:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2023-11-12 02:30:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2023-11-12 02:30:11,996 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2023-11-12 02:30:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2023-11-12 02:30:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2023-11-12 02:30:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2023-11-12 02:30:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2023-11-12 02:30:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2023-11-12 02:30:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2023-11-12 02:30:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2023-11-12 02:30:12,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2023-11-12 02:30:12,020 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2023-11-12 02:30:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2023-11-12 02:30:12,021 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2023-11-12 02:30:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2023-11-12 02:30:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2023-11-12 02:30:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2023-11-12 02:30:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2023-11-12 02:30:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2023-11-12 02:30:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2023-11-12 02:30:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2023-11-12 02:30:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2023-11-12 02:30:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2023-11-12 02:30:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2023-11-12 02:30:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2023-11-12 02:30:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2023-11-12 02:30:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2023-11-12 02:30:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:30:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2023-11-12 02:30:12,025 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2023-11-12 02:30:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2023-11-12 02:30:12,025 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2023-11-12 02:30:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2023-11-12 02:30:12,025 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2023-11-12 02:30:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:30:12,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:30:12,026 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2023-11-12 02:30:12,026 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2023-11-12 02:30:12,239 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:30:12,243 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:30:13,548 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:30:13,562 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:30:13,563 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:30:13,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:13 BoogieIcfgContainer [2023-11-12 02:30:13,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:30:13,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:30:13,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:30:13,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:30:13,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:30:10" (1/3) ... [2023-11-12 02:30:13,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779dd0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:13, skipping insertion in model container [2023-11-12 02:30:13,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:30:11" (2/3) ... [2023-11-12 02:30:13,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779dd0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:30:13, skipping insertion in model container [2023-11-12 02:30:13,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:30:13" (3/3) ... [2023-11-12 02:30:13,576 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product03.cil.c [2023-11-12 02:30:13,596 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:30:13,596 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:30:13,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:30:13,674 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ac83580, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:30:13,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:30:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 517 states, 402 states have (on average 1.681592039800995) internal successors, (676), 418 states have internal predecessors, (676), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2023-11-12 02:30:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-12 02:30:13,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:13,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:13,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:13,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1965651267, now seen corresponding path program 1 times [2023-11-12 02:30:13,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:13,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285293883] [2023-11-12 02:30:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:30:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:30:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:30:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:30:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:30:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-12 02:30:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285293883] [2023-11-12 02:30:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285293883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:14,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:14,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248846689] [2023-11-12 02:30:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:14,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:14,887 INFO L87 Difference]: Start difference. First operand has 517 states, 402 states have (on average 1.681592039800995) internal successors, (676), 418 states have internal predecessors, (676), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:20,863 INFO L93 Difference]: Finished difference Result 1231 states and 2072 transitions. [2023-11-12 02:30:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:30:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2023-11-12 02:30:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:20,895 INFO L225 Difference]: With dead ends: 1231 [2023-11-12 02:30:20,896 INFO L226 Difference]: Without dead ends: 710 [2023-11-12 02:30:20,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:30:20,913 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 1301 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:20,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1214 Invalid, 2672 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [371 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-12 02:30:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-12 02:30:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 512. [2023-11-12 02:30:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 398 states have (on average 1.670854271356784) internal successors, (665), 413 states have internal predecessors, (665), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-12 02:30:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 846 transitions. [2023-11-12 02:30:21,173 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 846 transitions. Word has length 101 [2023-11-12 02:30:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:21,174 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 846 transitions. [2023-11-12 02:30:21,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 846 transitions. [2023-11-12 02:30:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-12 02:30:21,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:21,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:21,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:30:21,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:21,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1219828463, now seen corresponding path program 1 times [2023-11-12 02:30:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516985978] [2023-11-12 02:30:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:21,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:30:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-12 02:30:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-12 02:30:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-12 02:30:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:30:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:30:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:30:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:21,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:21,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516985978] [2023-11-12 02:30:21,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516985978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:21,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:21,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891914034] [2023-11-12 02:30:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:21,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:21,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:21,748 INFO L87 Difference]: Start difference. First operand 512 states and 846 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:26,845 INFO L93 Difference]: Finished difference Result 1205 states and 1999 transitions. [2023-11-12 02:30:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:30:26,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2023-11-12 02:30:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:26,853 INFO L225 Difference]: With dead ends: 1205 [2023-11-12 02:30:26,854 INFO L226 Difference]: Without dead ends: 710 [2023-11-12 02:30:26,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:30:26,859 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 1271 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:26,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1187 Invalid, 2664 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [369 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-12 02:30:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-12 02:30:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 512. [2023-11-12 02:30:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 398 states have (on average 1.6683417085427135) internal successors, (664), 413 states have internal predecessors, (664), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-12 02:30:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 845 transitions. [2023-11-12 02:30:27,013 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 845 transitions. Word has length 102 [2023-11-12 02:30:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:27,014 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 845 transitions. [2023-11-12 02:30:27,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 845 transitions. [2023-11-12 02:30:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-12 02:30:27,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:27,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:27,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:30:27,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:27,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1726293121, now seen corresponding path program 1 times [2023-11-12 02:30:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656314184] [2023-11-12 02:30:27,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:30:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-12 02:30:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:30:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:30:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:30:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-12 02:30:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:30:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:27,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656314184] [2023-11-12 02:30:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656314184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251895332] [2023-11-12 02:30:27,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:27,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:27,447 INFO L87 Difference]: Start difference. First operand 512 states and 845 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:32,379 INFO L93 Difference]: Finished difference Result 1205 states and 1998 transitions. [2023-11-12 02:30:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:30:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2023-11-12 02:30:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:32,386 INFO L225 Difference]: With dead ends: 1205 [2023-11-12 02:30:32,386 INFO L226 Difference]: Without dead ends: 710 [2023-11-12 02:30:32,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:30:32,392 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 1267 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:32,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1182 Invalid, 2660 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [368 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-12 02:30:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-12 02:30:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 512. [2023-11-12 02:30:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 398 states have (on average 1.6658291457286432) internal successors, (663), 413 states have internal predecessors, (663), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-12 02:30:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 844 transitions. [2023-11-12 02:30:32,546 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 844 transitions. Word has length 103 [2023-11-12 02:30:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:32,547 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 844 transitions. [2023-11-12 02:30:32,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 844 transitions. [2023-11-12 02:30:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-12 02:30:32,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:32,553 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:32,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:30:32,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:32,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash -787669171, now seen corresponding path program 1 times [2023-11-12 02:30:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:32,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052446240] [2023-11-12 02:30:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:30:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:30:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:30:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:30:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:30:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:30:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:30:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052446240] [2023-11-12 02:30:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052446240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:32,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:32,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:32,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043441935] [2023-11-12 02:30:32,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:32,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:32,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:32,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:32,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:32,947 INFO L87 Difference]: Start difference. First operand 512 states and 844 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:37,609 INFO L93 Difference]: Finished difference Result 1205 states and 1997 transitions. [2023-11-12 02:30:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:30:37,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2023-11-12 02:30:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:37,621 INFO L225 Difference]: With dead ends: 1205 [2023-11-12 02:30:37,621 INFO L226 Difference]: Without dead ends: 710 [2023-11-12 02:30:37,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:30:37,627 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 1271 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:37,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1163 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-12 02:30:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-12 02:30:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 512. [2023-11-12 02:30:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 398 states have (on average 1.6633165829145728) internal successors, (662), 413 states have internal predecessors, (662), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-12 02:30:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 843 transitions. [2023-11-12 02:30:37,743 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 843 transitions. Word has length 104 [2023-11-12 02:30:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:37,744 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 843 transitions. [2023-11-12 02:30:37,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 843 transitions. [2023-11-12 02:30:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-12 02:30:37,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:37,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:37,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:30:37,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:37,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1999028667, now seen corresponding path program 1 times [2023-11-12 02:30:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:37,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614683184] [2023-11-12 02:30:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:30:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:30:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:30:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-12 02:30:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-12 02:30:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:30:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:30:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:38,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614683184] [2023-11-12 02:30:38,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614683184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:38,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:38,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441952581] [2023-11-12 02:30:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:38,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:38,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:38,143 INFO L87 Difference]: Start difference. First operand 512 states and 843 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:42,840 INFO L93 Difference]: Finished difference Result 1205 states and 1996 transitions. [2023-11-12 02:30:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:30:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2023-11-12 02:30:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:42,849 INFO L225 Difference]: With dead ends: 1205 [2023-11-12 02:30:42,849 INFO L226 Difference]: Without dead ends: 710 [2023-11-12 02:30:42,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:30:42,862 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 1255 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:42,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 1207 Invalid, 2660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-12 02:30:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-12 02:30:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 512. [2023-11-12 02:30:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 398 states have (on average 1.6608040201005025) internal successors, (661), 413 states have internal predecessors, (661), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-12 02:30:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 842 transitions. [2023-11-12 02:30:43,022 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 842 transitions. Word has length 105 [2023-11-12 02:30:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:43,023 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 842 transitions. [2023-11-12 02:30:43,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 842 transitions. [2023-11-12 02:30:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-12 02:30:43,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:43,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:43,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:30:43,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:43,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1946474889, now seen corresponding path program 1 times [2023-11-12 02:30:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:43,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281298314] [2023-11-12 02:30:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:30:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:30:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:30:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:30:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:30:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:30:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-12 02:30:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:43,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281298314] [2023-11-12 02:30:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281298314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:30:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286719460] [2023-11-12 02:30:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:43,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:30:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:30:43,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:30:43,530 INFO L87 Difference]: Start difference. First operand 512 states and 842 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-12 02:30:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:49,582 INFO L93 Difference]: Finished difference Result 1227 states and 2032 transitions. [2023-11-12 02:30:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:30:49,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2023-11-12 02:30:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:49,590 INFO L225 Difference]: With dead ends: 1227 [2023-11-12 02:30:49,590 INFO L226 Difference]: Without dead ends: 736 [2023-11-12 02:30:49,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:30:49,595 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 1390 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 4761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:49,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 2175 Invalid, 4761 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [379 Valid, 4382 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-12 02:30:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2023-11-12 02:30:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 525. [2023-11-12 02:30:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 408 states have (on average 1.6568627450980393) internal successors, (676), 425 states have internal predecessors, (676), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (94), 89 states have call predecessors, (94), 91 states have call successors, (94) [2023-11-12 02:30:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 862 transitions. [2023-11-12 02:30:49,726 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 862 transitions. Word has length 106 [2023-11-12 02:30:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:49,727 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 862 transitions. [2023-11-12 02:30:49,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-12 02:30:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 862 transitions. [2023-11-12 02:30:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-12 02:30:49,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:49,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:49,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:30:49,732 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:49,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1409960792, now seen corresponding path program 1 times [2023-11-12 02:30:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74950829] [2023-11-12 02:30:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:30:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:30:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:30:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:30:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:30:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-12 02:30:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-12 02:30:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74950829] [2023-11-12 02:30:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74950829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:50,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:50,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982259660] [2023-11-12 02:30:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:50,074 INFO L87 Difference]: Start difference. First operand 525 states and 862 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:30:54,955 INFO L93 Difference]: Finished difference Result 1270 states and 2105 transitions. [2023-11-12 02:30:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:30:54,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2023-11-12 02:30:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:30:54,962 INFO L225 Difference]: With dead ends: 1270 [2023-11-12 02:30:54,962 INFO L226 Difference]: Without dead ends: 770 [2023-11-12 02:30:54,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:30:54,967 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 1393 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:30:54,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1136 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-12 02:30:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2023-11-12 02:30:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 545. [2023-11-12 02:30:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 427 states have (on average 1.6510538641686183) internal successors, (705), 444 states have internal predecessors, (705), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-11-12 02:30:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 890 transitions. [2023-11-12 02:30:55,064 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 890 transitions. Word has length 106 [2023-11-12 02:30:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:30:55,064 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 890 transitions. [2023-11-12 02:30:55,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:30:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 890 transitions. [2023-11-12 02:30:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-12 02:30:55,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:30:55,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:30:55,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:30:55,070 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:30:55,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:30:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash 416871043, now seen corresponding path program 1 times [2023-11-12 02:30:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:30:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602727755] [2023-11-12 02:30:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:30:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:30:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:30:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:30:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:30:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:30:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:30:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:30:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:30:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:30:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:30:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:30:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-12 02:30:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:30:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602727755] [2023-11-12 02:30:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602727755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:30:55,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:30:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:30:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705942854] [2023-11-12 02:30:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:30:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:30:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:30:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:30:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:30:55,458 INFO L87 Difference]: Start difference. First operand 545 states and 890 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)