./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a3102ca0659fbbd15269b525dd7b096164ab7cd0af67dfa99033803ea46b0a8e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:41:14,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:41:14,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:41:14,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:41:14,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:41:14,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:41:14,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:41:14,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:41:14,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:41:14,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:41:14,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:41:14,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:41:14,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:41:14,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:41:14,570 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:41:14,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:41:14,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:41:14,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:41:14,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:41:14,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:41:14,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:41:14,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:41:14,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:41:14,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:41:14,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:41:14,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:41:14,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:41:14,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:41:14,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:41:14,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:41:14,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:41:14,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:41:14,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:41:14,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:41:14,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:41:14,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:41:14,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:41:14,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:41:14,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:41:14,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:41:14,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:41:14,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:41:14,581 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a3102ca0659fbbd15269b525dd7b096164ab7cd0af67dfa99033803ea46b0a8e [2024-10-14 02:41:14,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:41:14,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:41:14,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:41:14,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:41:14,872 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:41:14,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c [2024-10-14 02:41:16,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:41:16,661 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:41:16,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c [2024-10-14 02:41:16,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2b49be6/2c1671d19bb244a5bdc258fddd86def1/FLAGcd422bcf0 [2024-10-14 02:41:16,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e2b49be6/2c1671d19bb244a5bdc258fddd86def1 [2024-10-14 02:41:16,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:41:16,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:41:16,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:41:16,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:41:16,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:41:16,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:16" (1/1) ... [2024-10-14 02:41:16,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5888a638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:16, skipping insertion in model container [2024-10-14 02:41:16,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:16" (1/1) ... [2024-10-14 02:41:16,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:41:17,014 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c[3700,3713] [2024-10-14 02:41:17,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:41:17,279 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:41:17,287 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-14 02:41:17,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [86] [2024-10-14 02:41:17,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [186] [2024-10-14 02:41:17,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [195] [2024-10-14 02:41:17,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [315] [2024-10-14 02:41:17,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [355] [2024-10-14 02:41:17,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [705] [2024-10-14 02:41:17,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1071] [2024-10-14 02:41:17,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1738] [2024-10-14 02:41:17,290 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3255] [2024-10-14 02:41:17,299 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product11.cil.c[3700,3713] [2024-10-14 02:41:17,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:41:17,443 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:41:17,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17 WrapperNode [2024-10-14 02:41:17,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:41:17,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:41:17,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:41:17,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:41:17,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,544 INFO L138 Inliner]: procedures = 90, calls = 331, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 1060 [2024-10-14 02:41:17,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:41:17,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:41:17,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:41:17,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:41:17,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,592 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:41:17,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:41:17,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:41:17,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:41:17,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:41:17,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (1/1) ... [2024-10-14 02:41:17,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:41:17,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:41:17,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:41:17,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:41:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:41:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:41:17,774 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:41:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:41:17,774 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:41:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:41:17,774 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:41:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:41:17,775 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:41:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-14 02:41:17,776 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-14 02:41:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:41:17,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:41:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:41:17,776 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:41:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:41:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:41:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:41:17,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:41:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:41:17,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:41:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:41:17,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:41:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:41:17,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:41:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:41:17,779 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:41:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-14 02:41:17,779 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-14 02:41:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:41:17,779 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:41:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:41:17,779 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:41:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:41:17,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:41:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:41:17,780 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:41:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:41:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:41:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:41:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:41:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:41:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:41:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:41:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:41:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:41:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:41:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:41:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:41:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:41:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:41:17,784 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:41:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:41:17,785 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:41:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:41:17,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:41:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:41:17,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:41:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:41:17,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:41:17,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:41:17,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:41:19,160 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2024-10-14 02:41:19,161 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:41:19,264 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:41:19,268 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:41:19,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:19 BoogieIcfgContainer [2024-10-14 02:41:19,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:41:19,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:41:19,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:41:19,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:41:19,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:41:16" (1/3) ... [2024-10-14 02:41:19,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eceadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:19, skipping insertion in model container [2024-10-14 02:41:19,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:17" (2/3) ... [2024-10-14 02:41:19,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22eceadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:19, skipping insertion in model container [2024-10-14 02:41:19,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:19" (3/3) ... [2024-10-14 02:41:19,280 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product11.cil.c [2024-10-14 02:41:19,298 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:41:19,298 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:41:19,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:41:19,394 INFO L333 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, 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;@6b743a47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:41:19,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:41:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 506 states, 391 states have (on average 1.7186700767263428) internal successors, (672), 407 states have internal predecessors, (672), 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) [2024-10-14 02:41:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 02:41:19,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:19,430 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:19,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash -881218989, now seen corresponding path program 1 times [2024-10-14 02:41:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722904911] [2024-10-14 02:41:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:19,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:41:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:41:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:41:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:41:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:41:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:41:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:41:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:20,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722904911] [2024-10-14 02:41:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722904911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798119596] [2024-10-14 02:41:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:20,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:20,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:20,494 INFO L87 Difference]: Start difference. First operand has 506 states, 391 states have (on average 1.7186700767263428) internal successors, (672), 407 states have internal predecessors, (672), 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 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:24,945 INFO L93 Difference]: Finished difference Result 1199 states and 2054 transitions. [2024-10-14 02:41:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:41:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-10-14 02:41:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:24,975 INFO L225 Difference]: With dead ends: 1199 [2024-10-14 02:41:24,976 INFO L226 Difference]: Without dead ends: 687 [2024-10-14 02:41:24,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:41:24,992 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1289 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:24,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 1072 Invalid, 2785 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [370 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:41:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-14 02:41:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2024-10-14 02:41:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.70076726342711) internal successors, (665), 406 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) [2024-10-14 02:41:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 846 transitions. [2024-10-14 02:41:25,206 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 846 transitions. Word has length 89 [2024-10-14 02:41:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:25,207 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 846 transitions. [2024-10-14 02:41:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 846 transitions. [2024-10-14 02:41:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 02:41:25,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:25,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:25,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:41:25,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:25,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1711188216, now seen corresponding path program 1 times [2024-10-14 02:41:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968192910] [2024-10-14 02:41:25,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:41:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:41:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:41:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:41:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:41:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:41:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:41:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968192910] [2024-10-14 02:41:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968192910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:25,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192671878] [2024-10-14 02:41:25,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:25,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:25,630 INFO L87 Difference]: Start difference. First operand 505 states and 846 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:29,386 INFO L93 Difference]: Finished difference Result 1180 states and 1988 transitions. [2024-10-14 02:41:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:41:29,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-10-14 02:41:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:29,398 INFO L225 Difference]: With dead ends: 1180 [2024-10-14 02:41:29,398 INFO L226 Difference]: Without dead ends: 687 [2024-10-14 02:41:29,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:29,404 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1273 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:29,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1033 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:41:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-14 02:41:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2024-10-14 02:41:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6982097186700766) internal successors, (664), 406 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) [2024-10-14 02:41:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 845 transitions. [2024-10-14 02:41:29,497 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 845 transitions. Word has length 90 [2024-10-14 02:41:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:29,498 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 845 transitions. [2024-10-14 02:41:29,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 845 transitions. [2024-10-14 02:41:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 02:41:29,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:29,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:29,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:41:29,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:29,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash 979281911, now seen corresponding path program 1 times [2024-10-14 02:41:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:29,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733199185] [2024-10-14 02:41:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:41:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:41:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:41:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:41:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:41:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:41:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:41:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:29,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:29,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733199185] [2024-10-14 02:41:29,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733199185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432888483] [2024-10-14 02:41:29,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:29,882 INFO L87 Difference]: Start difference. First operand 505 states and 845 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:32,947 INFO L93 Difference]: Finished difference Result 1180 states and 1987 transitions. [2024-10-14 02:41:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:41:32,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2024-10-14 02:41:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:32,952 INFO L225 Difference]: With dead ends: 1180 [2024-10-14 02:41:32,952 INFO L226 Difference]: Without dead ends: 687 [2024-10-14 02:41:32,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:32,957 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1267 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:32,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1040 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:41:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-14 02:41:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2024-10-14 02:41:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6956521739130435) internal successors, (663), 406 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) [2024-10-14 02:41:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 844 transitions. [2024-10-14 02:41:33,046 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 844 transitions. Word has length 91 [2024-10-14 02:41:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:33,048 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 844 transitions. [2024-10-14 02:41:33,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 844 transitions. [2024-10-14 02:41:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 02:41:33,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:33,052 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:33,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:41:33,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:33,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1134222316, now seen corresponding path program 1 times [2024-10-14 02:41:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694849457] [2024-10-14 02:41:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:33,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:41:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:41:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:41:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:41:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:41:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:41:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:41:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:33,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:33,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694849457] [2024-10-14 02:41:33,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694849457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:33,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:33,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246274402] [2024-10-14 02:41:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:33,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:33,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:33,402 INFO L87 Difference]: Start difference. First operand 505 states and 844 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:36,654 INFO L93 Difference]: Finished difference Result 1180 states and 1986 transitions. [2024-10-14 02:41:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:41:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2024-10-14 02:41:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:36,660 INFO L225 Difference]: With dead ends: 1180 [2024-10-14 02:41:36,660 INFO L226 Difference]: Without dead ends: 687 [2024-10-14 02:41:36,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:36,665 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1273 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:36,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1006 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:41:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-14 02:41:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2024-10-14 02:41:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6930946291560103) internal successors, (662), 406 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) [2024-10-14 02:41:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 843 transitions. [2024-10-14 02:41:36,780 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 843 transitions. Word has length 92 [2024-10-14 02:41:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:36,781 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 843 transitions. [2024-10-14 02:41:36,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 843 transitions. [2024-10-14 02:41:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 02:41:36,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:36,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:36,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:41:36,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:36,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:36,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2847333, now seen corresponding path program 1 times [2024-10-14 02:41:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:36,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933746831] [2024-10-14 02:41:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:41:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:41:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:41:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:41:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:41:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:41:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:41:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:37,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933746831] [2024-10-14 02:41:37,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933746831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:37,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:37,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72937112] [2024-10-14 02:41:37,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:37,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:37,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:37,116 INFO L87 Difference]: Start difference. First operand 505 states and 843 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:40,118 INFO L93 Difference]: Finished difference Result 1180 states and 1985 transitions. [2024-10-14 02:41:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:41:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2024-10-14 02:41:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:40,123 INFO L225 Difference]: With dead ends: 1180 [2024-10-14 02:41:40,123 INFO L226 Difference]: Without dead ends: 687 [2024-10-14 02:41:40,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:40,127 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1262 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:40,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 1029 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:41:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-14 02:41:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2024-10-14 02:41:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6905370843989769) internal successors, (661), 406 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) [2024-10-14 02:41:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 842 transitions. [2024-10-14 02:41:40,213 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 842 transitions. Word has length 93 [2024-10-14 02:41:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:40,213 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 842 transitions. [2024-10-14 02:41:40,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 842 transitions. [2024-10-14 02:41:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 02:41:40,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:40,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:40,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:41:40,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:40,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1757444304, now seen corresponding path program 1 times [2024-10-14 02:41:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:40,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086568814] [2024-10-14 02:41:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:41:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:41:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:41:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:41:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:41:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:41:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:40,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:40,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086568814] [2024-10-14 02:41:40,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086568814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:40,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:40,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:41:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112636740] [2024-10-14 02:41:40,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:40,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:41:40,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:41:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:40,640 INFO L87 Difference]: Start difference. First operand 505 states and 842 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:41:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:44,782 INFO L93 Difference]: Finished difference Result 1200 states and 2019 transitions. [2024-10-14 02:41:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 02:41:44,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 94 [2024-10-14 02:41:44,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:44,787 INFO L225 Difference]: With dead ends: 1200 [2024-10-14 02:41:44,787 INFO L226 Difference]: Without dead ends: 711 [2024-10-14 02:41:44,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-10-14 02:41:44,790 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1372 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 4616 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 4992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 4616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:44,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 1893 Invalid, 4992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 4616 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:41:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-14 02:41:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 517. [2024-10-14 02:41:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.6875) internal successors, (675), 417 states have internal predecessors, (675), 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) [2024-10-14 02:41:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 861 transitions. [2024-10-14 02:41:44,880 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 861 transitions. Word has length 94 [2024-10-14 02:41:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:44,881 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 861 transitions. [2024-10-14 02:41:44,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:41:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 861 transitions. [2024-10-14 02:41:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 02:41:44,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:44,884 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:44,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:41:44,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash 272388753, now seen corresponding path program 1 times [2024-10-14 02:41:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051162775] [2024-10-14 02:41:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:41:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:41:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:41:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:41:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:41:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:41:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:45,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:45,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051162775] [2024-10-14 02:41:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051162775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:45,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812781014] [2024-10-14 02:41:45,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:45,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:45,161 INFO L87 Difference]: Start difference. First operand 517 states and 861 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:48,295 INFO L93 Difference]: Finished difference Result 1251 states and 2107 transitions. [2024-10-14 02:41:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:41:48,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2024-10-14 02:41:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:48,300 INFO L225 Difference]: With dead ends: 1251 [2024-10-14 02:41:48,300 INFO L226 Difference]: Without dead ends: 754 [2024-10-14 02:41:48,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:41:48,303 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1342 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:48,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1043 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:41:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-14 02:41:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 536. [2024-10-14 02:41:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 418 states have (on average 1.6818181818181819) internal successors, (703), 435 states have internal predecessors, (703), 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) [2024-10-14 02:41:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 888 transitions. [2024-10-14 02:41:48,411 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 888 transitions. Word has length 94 [2024-10-14 02:41:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:48,411 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 888 transitions. [2024-10-14 02:41:48,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 888 transitions. [2024-10-14 02:41:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:41:48,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:48,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:48,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:41:48,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:48,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash -800450367, now seen corresponding path program 1 times [2024-10-14 02:41:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676091669] [2024-10-14 02:41:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:41:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:41:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:41:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:41:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:41:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:41:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676091669] [2024-10-14 02:41:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676091669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:48,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546119737] [2024-10-14 02:41:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:48,694 INFO L87 Difference]: Start difference. First operand 536 states and 888 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:51,520 INFO L93 Difference]: Finished difference Result 1226 states and 2042 transitions. [2024-10-14 02:41:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:41:51,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-14 02:41:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:51,524 INFO L225 Difference]: With dead ends: 1226 [2024-10-14 02:41:51,524 INFO L226 Difference]: Without dead ends: 746 [2024-10-14 02:41:51,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:41:51,527 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1312 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:51,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 1060 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 02:41:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-14 02:41:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 536. [2024-10-14 02:41:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 418 states have (on average 1.6698564593301435) internal successors, (698), 435 states have internal predecessors, (698), 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) [2024-10-14 02:41:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 883 transitions. [2024-10-14 02:41:51,622 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 883 transitions. Word has length 95 [2024-10-14 02:41:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:51,622 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 883 transitions. [2024-10-14 02:41:51,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 883 transitions. [2024-10-14 02:41:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:41:51,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:51,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:51,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:41:51,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:51,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:51,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1550383980, now seen corresponding path program 1 times [2024-10-14 02:41:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:51,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994473251] [2024-10-14 02:41:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:41:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:41:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:41:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:41:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:41:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:41:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994473251] [2024-10-14 02:41:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994473251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:51,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028192682] [2024-10-14 02:41:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:51,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:51,932 INFO L87 Difference]: Start difference. First operand 536 states and 883 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:54,829 INFO L93 Difference]: Finished difference Result 1226 states and 2037 transitions. [2024-10-14 02:41:54,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:41:54,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-10-14 02:41:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:54,834 INFO L225 Difference]: With dead ends: 1226 [2024-10-14 02:41:54,834 INFO L226 Difference]: Without dead ends: 746 [2024-10-14 02:41:54,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:41:54,837 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1327 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:54,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 991 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:41:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-14 02:41:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 536. [2024-10-14 02:41:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 418 states have (on average 1.6578947368421053) internal successors, (693), 435 states have internal predecessors, (693), 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) [2024-10-14 02:41:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 878 transitions. [2024-10-14 02:41:54,933 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 878 transitions. Word has length 96 [2024-10-14 02:41:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:54,934 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 878 transitions. [2024-10-14 02:41:54,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 878 transitions. [2024-10-14 02:41:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:41:54,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:54,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:54,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:41:54,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:54,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:54,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2031516636, now seen corresponding path program 1 times [2024-10-14 02:41:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409170530] [2024-10-14 02:41:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:41:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:41:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:41:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:41:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:41:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:41:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409170530] [2024-10-14 02:41:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409170530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:41:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072436881] [2024-10-14 02:41:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:55,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:41:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:55,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:41:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:55,290 INFO L87 Difference]: Start difference. First operand 536 states and 878 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:41:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:59,223 INFO L93 Difference]: Finished difference Result 1206 states and 1998 transitions. [2024-10-14 02:41:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:41:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-10-14 02:41:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:59,226 INFO L225 Difference]: With dead ends: 1206 [2024-10-14 02:41:59,227 INFO L226 Difference]: Without dead ends: 740 [2024-10-14 02:41:59,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:41:59,229 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1311 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 4842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:59,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 1885 Invalid, 4842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:41:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-10-14 02:41:59,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 538. [2024-10-14 02:41:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 420 states have (on average 1.6523809523809523) internal successors, (694), 437 states have internal predecessors, (694), 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) [2024-10-14 02:41:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 879 transitions. [2024-10-14 02:41:59,325 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 879 transitions. Word has length 97 [2024-10-14 02:41:59,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:59,325 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 879 transitions. [2024-10-14 02:41:59,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:41:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 879 transitions. [2024-10-14 02:41:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:41:59,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:59,328 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:59,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:41:59,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1634053892, now seen corresponding path program 1 times [2024-10-14 02:41:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285518828] [2024-10-14 02:41:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:41:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:41:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:41:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:41:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:41:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:41:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285518828] [2024-10-14 02:41:59,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285518828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:59,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446772609] [2024-10-14 02:41:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:59,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:59,586 INFO L87 Difference]: Start difference. First operand 538 states and 879 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:02,300 INFO L93 Difference]: Finished difference Result 1230 states and 2031 transitions. [2024-10-14 02:42:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2024-10-14 02:42:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:02,304 INFO L225 Difference]: With dead ends: 1230 [2024-10-14 02:42:02,304 INFO L226 Difference]: Without dead ends: 748 [2024-10-14 02:42:02,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:02,306 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1307 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 2357 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:02,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 1036 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2357 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 02:42:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-10-14 02:42:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 538. [2024-10-14 02:42:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 420 states have (on average 1.6404761904761904) internal successors, (689), 437 states have internal predecessors, (689), 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) [2024-10-14 02:42:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 874 transitions. [2024-10-14 02:42:02,419 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 874 transitions. Word has length 97 [2024-10-14 02:42:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:02,419 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 874 transitions. [2024-10-14 02:42:02,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 874 transitions. [2024-10-14 02:42:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 02:42:02,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:02,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:02,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:42:02,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:02,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash 758062505, now seen corresponding path program 1 times [2024-10-14 02:42:02,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798628237] [2024-10-14 02:42:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:02,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:42:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:42:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:42:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:42:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:42:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:42:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798628237] [2024-10-14 02:42:02,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798628237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:02,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:02,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:02,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485972322] [2024-10-14 02:42:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:02,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:02,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:02,752 INFO L87 Difference]: Start difference. First operand 538 states and 874 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:06,822 INFO L93 Difference]: Finished difference Result 1219 states and 2005 transitions. [2024-10-14 02:42:06,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:42:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2024-10-14 02:42:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:06,826 INFO L225 Difference]: With dead ends: 1219 [2024-10-14 02:42:06,826 INFO L226 Difference]: Without dead ends: 749 [2024-10-14 02:42:06,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:06,827 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1290 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 4472 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 4847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 4472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:06,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 1989 Invalid, 4847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 4472 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:42:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-10-14 02:42:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 544. [2024-10-14 02:42:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 426 states have (on average 1.6291079812206573) internal successors, (694), 443 states have internal predecessors, (694), 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) [2024-10-14 02:42:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 879 transitions. [2024-10-14 02:42:06,927 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 879 transitions. Word has length 98 [2024-10-14 02:42:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:06,928 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 879 transitions. [2024-10-14 02:42:06,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 879 transitions. [2024-10-14 02:42:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 02:42:06,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:06,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:06,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:42:06,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:06,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:06,932 INFO L85 PathProgramCache]: Analyzing trace with hash -318271417, now seen corresponding path program 1 times [2024-10-14 02:42:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746575535] [2024-10-14 02:42:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:42:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:42:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:42:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:42:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:42:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:42:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:07,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:07,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746575535] [2024-10-14 02:42:07,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746575535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:07,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:07,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299103116] [2024-10-14 02:42:07,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:07,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:07,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:07,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:07,189 INFO L87 Difference]: Start difference. First operand 544 states and 879 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:10,026 INFO L93 Difference]: Finished difference Result 1245 states and 2036 transitions. [2024-10-14 02:42:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:10,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-14 02:42:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:10,030 INFO L225 Difference]: With dead ends: 1245 [2024-10-14 02:42:10,030 INFO L226 Difference]: Without dead ends: 757 [2024-10-14 02:42:10,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:10,032 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1304 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:10,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1011 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 02:42:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-14 02:42:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 544. [2024-10-14 02:42:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 426 states have (on average 1.6173708920187793) internal successors, (689), 443 states have internal predecessors, (689), 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) [2024-10-14 02:42:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 874 transitions. [2024-10-14 02:42:10,136 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 874 transitions. Word has length 98 [2024-10-14 02:42:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:10,136 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 874 transitions. [2024-10-14 02:42:10,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 874 transitions. [2024-10-14 02:42:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:42:10,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:10,140 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:10,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:42:10,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:10,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2141220073, now seen corresponding path program 1 times [2024-10-14 02:42:10,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:10,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843232510] [2024-10-14 02:42:10,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:42:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:42:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:42:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:42:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:42:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:42:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843232510] [2024-10-14 02:42:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843232510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:10,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833122509] [2024-10-14 02:42:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:10,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:10,439 INFO L87 Difference]: Start difference. First operand 544 states and 874 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:14,163 INFO L93 Difference]: Finished difference Result 1234 states and 2012 transitions. [2024-10-14 02:42:14,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:42:14,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2024-10-14 02:42:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:14,167 INFO L225 Difference]: With dead ends: 1234 [2024-10-14 02:42:14,168 INFO L226 Difference]: Without dead ends: 761 [2024-10-14 02:42:14,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:14,170 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1292 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 4415 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 4792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 4415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:14,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 1916 Invalid, 4792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 4415 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 02:42:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-14 02:42:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 552. [2024-10-14 02:42:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 434 states have (on average 1.6036866359447004) internal successors, (696), 451 states have internal predecessors, (696), 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) [2024-10-14 02:42:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 881 transitions. [2024-10-14 02:42:14,293 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 881 transitions. Word has length 99 [2024-10-14 02:42:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 881 transitions. [2024-10-14 02:42:14,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 881 transitions. [2024-10-14 02:42:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:42:14,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:14,296 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:42:14,296 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1229578953, now seen corresponding path program 1 times [2024-10-14 02:42:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126033962] [2024-10-14 02:42:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:42:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:42:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:42:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:42:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:42:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:42:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:14,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:14,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126033962] [2024-10-14 02:42:14,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126033962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:14,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:14,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013024586] [2024-10-14 02:42:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:14,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:14,536 INFO L87 Difference]: Start difference. First operand 552 states and 881 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:17,367 INFO L93 Difference]: Finished difference Result 1289 states and 2076 transitions. [2024-10-14 02:42:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:17,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-14 02:42:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:17,371 INFO L225 Difference]: With dead ends: 1289 [2024-10-14 02:42:17,372 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 02:42:17,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:17,374 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1246 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:17,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1019 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 02:42:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 02:42:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 534. [2024-10-14 02:42:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 419 states have (on average 1.6085918854415275) internal successors, (674), 434 states have internal predecessors, (674), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:42:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 855 transitions. [2024-10-14 02:42:17,478 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 855 transitions. Word has length 99 [2024-10-14 02:42:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:17,478 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 855 transitions. [2024-10-14 02:42:17,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 855 transitions. [2024-10-14 02:42:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 02:42:17,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:17,482 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:17,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:42:17,482 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 393390340, now seen corresponding path program 1 times [2024-10-14 02:42:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:17,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337097923] [2024-10-14 02:42:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:42:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:42:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:42:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:42:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:42:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:42:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:17,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337097923] [2024-10-14 02:42:17,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337097923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:17,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:17,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768594083] [2024-10-14 02:42:17,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:17,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:17,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:17,782 INFO L87 Difference]: Start difference. First operand 534 states and 855 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:20,496 INFO L93 Difference]: Finished difference Result 1221 states and 1983 transitions. [2024-10-14 02:42:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:42:20,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-14 02:42:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:20,500 INFO L225 Difference]: With dead ends: 1221 [2024-10-14 02:42:20,500 INFO L226 Difference]: Without dead ends: 746 [2024-10-14 02:42:20,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:20,503 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1258 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:20,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 1045 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 02:42:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-14 02:42:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 544. [2024-10-14 02:42:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 429 states have (on average 1.5944055944055944) internal successors, (684), 444 states have internal predecessors, (684), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:42:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 865 transitions. [2024-10-14 02:42:20,596 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 865 transitions. Word has length 100 [2024-10-14 02:42:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:20,596 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 865 transitions. [2024-10-14 02:42:20,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 865 transitions. [2024-10-14 02:42:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:42:20,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:20,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:20,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:42:20,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -836366524, now seen corresponding path program 1 times [2024-10-14 02:42:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594866939] [2024-10-14 02:42:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:42:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:42:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:42:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:42:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:42:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594866939] [2024-10-14 02:42:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594866939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:20,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:20,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:20,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091224959] [2024-10-14 02:42:20,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:20,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:20,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:20,887 INFO L87 Difference]: Start difference. First operand 544 states and 865 transitions. 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, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:23,814 INFO L93 Difference]: Finished difference Result 1238 states and 1995 transitions. [2024-10-14 02:42:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:42:23,815 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, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-10-14 02:42:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:23,818 INFO L225 Difference]: With dead ends: 1238 [2024-10-14 02:42:23,818 INFO L226 Difference]: Without dead ends: 738 [2024-10-14 02:42:23,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:23,820 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1305 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:23,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 1018 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 02:42:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-14 02:42:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 544. [2024-10-14 02:42:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 429 states have (on average 1.5850815850815851) internal successors, (680), 444 states have internal predecessors, (680), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 02:42:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 861 transitions. [2024-10-14 02:42:23,928 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 861 transitions. Word has length 101 [2024-10-14 02:42:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:23,929 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 861 transitions. [2024-10-14 02:42:23,929 INFO L472 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, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 861 transitions. [2024-10-14 02:42:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:42:23,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:23,932 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:23,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 02:42:23,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:23,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash -863432126, now seen corresponding path program 1 times [2024-10-14 02:42:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025308188] [2024-10-14 02:42:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:42:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:42:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:42:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:42:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:42:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 02:42:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025308188] [2024-10-14 02:42:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025308188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397488673] [2024-10-14 02:42:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:24,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:24,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:24,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:42:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:24,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:24,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 02:42:24,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397488673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:24,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 02:42:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791630550] [2024-10-14 02:42:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:24,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:24,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:24,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:24,608 INFO L87 Difference]: Start difference. First operand 544 states and 861 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:25,236 INFO L93 Difference]: Finished difference Result 1026 states and 1674 transitions. [2024-10-14 02:42:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-10-14 02:42:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:25,240 INFO L225 Difference]: With dead ends: 1026 [2024-10-14 02:42:25,240 INFO L226 Difference]: Without dead ends: 552 [2024-10-14 02:42:25,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:25,243 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 775 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:25,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1974 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 02:42:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-14 02:42:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2024-10-14 02:42:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 436 states have (on average 1.5871559633027523) internal successors, (692), 451 states have internal predecessors, (692), 91 states have call successors, (91), 25 states have call predecessors, (91), 24 states have return successors, (91), 88 states have call predecessors, (91), 90 states have call successors, (91) [2024-10-14 02:42:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 874 transitions. [2024-10-14 02:42:25,341 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 874 transitions. Word has length 101 [2024-10-14 02:42:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:25,341 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 874 transitions. [2024-10-14 02:42:25,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 874 transitions. [2024-10-14 02:42:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 02:42:25,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:25,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:25,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:42:25,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 02:42:25,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:25,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:25,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1929544579, now seen corresponding path program 1 times [2024-10-14 02:42:25,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:25,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275327137] [2024-10-14 02:42:25,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:25,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:42:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:42:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:42:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:42:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:42:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:42:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 02:42:25,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275327137] [2024-10-14 02:42:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275327137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:25,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528585362] [2024-10-14 02:42:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:25,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:25,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:25,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:25,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:42:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:26,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 02:42:26,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528585362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:26,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 02:42:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443367817] [2024-10-14 02:42:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:26,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:26,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:26,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:26,181 INFO L87 Difference]: Start difference. First operand 552 states and 874 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:26,642 INFO L93 Difference]: Finished difference Result 1042 states and 1697 transitions. [2024-10-14 02:42:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:26,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-14 02:42:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:26,646 INFO L225 Difference]: With dead ends: 1042 [2024-10-14 02:42:26,646 INFO L226 Difference]: Without dead ends: 560 [2024-10-14 02:42:26,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:26,650 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 772 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:26,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1971 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 02:42:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-14 02:42:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-10-14 02:42:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 443 states have (on average 1.5891647855530473) internal successors, (704), 458 states have internal predecessors, (704), 91 states have call successors, (91), 26 states have call predecessors, (91), 25 states have return successors, (92), 88 states have call predecessors, (92), 90 states have call successors, (92) [2024-10-14 02:42:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 887 transitions. [2024-10-14 02:42:26,748 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 887 transitions. Word has length 104 [2024-10-14 02:42:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:26,749 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 887 transitions. [2024-10-14 02:42:26,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 887 transitions. [2024-10-14 02:42:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:42:26,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:26,751 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:26,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:42:26,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:26,952 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:26,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1747128546, now seen corresponding path program 1 times [2024-10-14 02:42:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:26,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264975554] [2024-10-14 02:42:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:42:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:42:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:42:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:42:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:42:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:42:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 02:42:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264975554] [2024-10-14 02:42:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264975554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390689997] [2024-10-14 02:42:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:27,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:27,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:27,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:42:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:27,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:27,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 02:42:27,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:27,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390689997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:27,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:27,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 02:42:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120429657] [2024-10-14 02:42:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:27,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:27,586 INFO L87 Difference]: Start difference. First operand 560 states and 887 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:28,019 INFO L93 Difference]: Finished difference Result 1058 states and 1720 transitions. [2024-10-14 02:42:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-10-14 02:42:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:28,023 INFO L225 Difference]: With dead ends: 1058 [2024-10-14 02:42:28,023 INFO L226 Difference]: Without dead ends: 568 [2024-10-14 02:42:28,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:28,026 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 764 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:28,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1968 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 02:42:28,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-14 02:42:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2024-10-14 02:42:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 450 states have (on average 1.5911111111111111) internal successors, (716), 465 states have internal predecessors, (716), 91 states have call successors, (91), 27 states have call predecessors, (91), 26 states have return successors, (93), 88 states have call predecessors, (93), 90 states have call successors, (93) [2024-10-14 02:42:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 900 transitions. [2024-10-14 02:42:28,128 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 900 transitions. Word has length 107 [2024-10-14 02:42:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:28,128 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 900 transitions. [2024-10-14 02:42:28,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 900 transitions. [2024-10-14 02:42:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 02:42:28,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:28,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:28,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 02:42:28,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:28,330 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:28,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 958419095, now seen corresponding path program 1 times [2024-10-14 02:42:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818479651] [2024-10-14 02:42:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:42:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:42:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:42:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:42:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:42:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 02:42:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 02:42:28,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:28,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818479651] [2024-10-14 02:42:28,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818479651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:28,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839780422] [2024-10-14 02:42:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:28,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:28,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:28,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:28,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:42:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:28,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:28,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 02:42:28,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:28,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839780422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:28,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 02:42:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538213814] [2024-10-14 02:42:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:28,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:28,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:28,973 INFO L87 Difference]: Start difference. First operand 568 states and 900 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:29,428 INFO L93 Difference]: Finished difference Result 1074 states and 1743 transitions. [2024-10-14 02:42:29,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:29,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-10-14 02:42:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:29,431 INFO L225 Difference]: With dead ends: 1074 [2024-10-14 02:42:29,432 INFO L226 Difference]: Without dead ends: 576 [2024-10-14 02:42:29,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:29,435 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 759 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:29,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1965 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 02:42:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-14 02:42:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2024-10-14 02:42:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 457 states have (on average 1.5929978118161925) internal successors, (728), 472 states have internal predecessors, (728), 91 states have call successors, (91), 28 states have call predecessors, (91), 27 states have return successors, (94), 88 states have call predecessors, (94), 90 states have call successors, (94) [2024-10-14 02:42:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 913 transitions. [2024-10-14 02:42:29,525 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 913 transitions. Word has length 110 [2024-10-14 02:42:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:29,525 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 913 transitions. [2024-10-14 02:42:29,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 913 transitions. [2024-10-14 02:42:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 02:42:29,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:29,527 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:29,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 02:42:29,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:29,728 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:29,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 130602490, now seen corresponding path program 1 times [2024-10-14 02:42:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268224152] [2024-10-14 02:42:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:29,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:42:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:42:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:42:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:42:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 02:42:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:42:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:30,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268224152] [2024-10-14 02:42:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268224152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:30,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863844021] [2024-10-14 02:42:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:30,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:30,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:30,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:30,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:42:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 02:42:30,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:42:30,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:30,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863844021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:30,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:30,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-14 02:42:30,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833254103] [2024-10-14 02:42:30,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:30,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:30,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:30,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:30,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:42:30,712 INFO L87 Difference]: Start difference. First operand 576 states and 913 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:31,264 INFO L93 Difference]: Finished difference Result 1594 states and 2617 transitions. [2024-10-14 02:42:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:42:31,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-10-14 02:42:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:31,270 INFO L225 Difference]: With dead ends: 1594 [2024-10-14 02:42:31,270 INFO L226 Difference]: Without dead ends: 1088 [2024-10-14 02:42:31,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:31,272 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 743 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:31,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 2998 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 02:42:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-14 02:42:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1080. [2024-10-14 02:42:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 850 states have (on average 1.6176470588235294) internal successors, (1375), 881 states have internal predecessors, (1375), 176 states have call successors, (176), 53 states have call predecessors, (176), 53 states have return successors, (202), 171 states have call predecessors, (202), 174 states have call successors, (202) [2024-10-14 02:42:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1753 transitions. [2024-10-14 02:42:31,443 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1753 transitions. Word has length 113 [2024-10-14 02:42:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:31,444 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1753 transitions. [2024-10-14 02:42:31,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1753 transitions. [2024-10-14 02:42:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 02:42:31,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:31,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:31,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 02:42:31,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 02:42:31,648 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:31,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 331074965, now seen corresponding path program 1 times [2024-10-14 02:42:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:31,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613847093] [2024-10-14 02:42:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:42:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:42:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:42:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:42:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 02:42:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:42:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613847093] [2024-10-14 02:42:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613847093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005626985] [2024-10-14 02:42:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:32,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:32,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:42:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 02:42:32,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:42:32,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005626985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2024-10-14 02:42:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814719598] [2024-10-14 02:42:32,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:42:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:32,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:42:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:32,475 INFO L87 Difference]: Start difference. First operand 1080 states and 1753 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:42:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:32,775 INFO L93 Difference]: Finished difference Result 2587 states and 4282 transitions. [2024-10-14 02:42:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:42:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-14 02:42:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:32,782 INFO L225 Difference]: With dead ends: 2587 [2024-10-14 02:42:32,782 INFO L226 Difference]: Without dead ends: 1578 [2024-10-14 02:42:32,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:32,788 INFO L432 NwaCegarLoop]: 1520 mSDtfsCounter, 754 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:32,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 2308 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:42:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-10-14 02:42:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1080. [2024-10-14 02:42:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 850 states have (on average 1.616470588235294) internal successors, (1374), 881 states have internal predecessors, (1374), 176 states have call successors, (176), 53 states have call predecessors, (176), 53 states have return successors, (202), 171 states have call predecessors, (202), 174 states have call successors, (202) [2024-10-14 02:42:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1752 transitions. [2024-10-14 02:42:32,966 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1752 transitions. Word has length 117 [2024-10-14 02:42:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:32,966 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1752 transitions. [2024-10-14 02:42:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 02:42:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1752 transitions. [2024-10-14 02:42:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 02:42:32,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:32,969 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:32,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 02:42:33,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:33,170 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:33,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2040664297, now seen corresponding path program 1 times [2024-10-14 02:42:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602508872] [2024-10-14 02:42:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat