./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_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f6cc861ca86011eb32ffd09a18c7045c0cb28e684d3b73d1659bc499a4213e84 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:31:45,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:31:45,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:31:45,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:31:45,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:31:45,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:31:45,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:31:45,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:31:45,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:31:45,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:31:45,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:31:45,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:31:45,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:31:45,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:31:45,576 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:31:45,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:31:45,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:31:45,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:31:45,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:31:45,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:31:45,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:31:45,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:31:45,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:31:45,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:31:45,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:31:45,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:31:45,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:31:45,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:31:45,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:31:45,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:31:45,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:31:45,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:31:45,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:45,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:31:45,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:31:45,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:31:45,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:31:45,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:31:45,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:31:45,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:31:45,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:31:45,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:31:45,584 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-clean/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-clean/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 -> f6cc861ca86011eb32ffd09a18c7045c0cb28e684d3b73d1659bc499a4213e84 [2024-10-11 02:31:45,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:31:45,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:31:45,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:31:45,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:31:45,803 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:31:45,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c [2024-10-11 02:31:47,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:31:47,244 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:31:47,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product20.cil.c [2024-10-11 02:31:47,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c75c92d2/761eb36fceb74ab5877f2b5420d99d46/FLAG758d21f81 [2024-10-11 02:31:47,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c75c92d2/761eb36fceb74ab5877f2b5420d99d46 [2024-10-11 02:31:47,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:31:47,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:31:47,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:47,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:31:47,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:31:47,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8f6830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47, skipping insertion in model container [2024-10-11 02:31:47,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:31:47,736 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_product20.cil.c[69987,70000] [2024-10-11 02:31:47,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:47,749 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:31:47,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-10-11 02:31:47,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [414] [2024-10-11 02:31:47,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [517] [2024-10-11 02:31:47,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [558] [2024-10-11 02:31:47,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [911] [2024-10-11 02:31:47,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [946] [2024-10-11 02:31:47,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [960] [2024-10-11 02:31:47,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1627] [2024-10-11 02:31:47,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3197] [2024-10-11 02:31:47,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3315] [2024-10-11 02:31:47,830 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_product20.cil.c[69987,70000] [2024-10-11 02:31:47,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:47,858 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:31:47,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47 WrapperNode [2024-10-11 02:31:47,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:47,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:47,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:31:47,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:31:47,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,943 INFO L138 Inliner]: procedures = 93, calls = 339, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 1059 [2024-10-11 02:31:47,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:47,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:31:47,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:31:47,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:31:47,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,997 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-11 02:31:47,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:47,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:48,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:48,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:48,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:48,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:48,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:31:48,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:31:48,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:31:48,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:31:48,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (1/1) ... [2024-10-11 02:31:48,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:48,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:31:48,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:31:48,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:31:48,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:31:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:31:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:31:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:31:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:31:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-11 02:31:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-11 02:31:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:31:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:31:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:31:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:31:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:31:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:31:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:31:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:31:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:31:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:31:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:31:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:31:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:31:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:31:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:31:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:31:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:31:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:31:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:31:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:31:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:31:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:31:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:31:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:31:48,111 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:31:48,111 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:31:48,111 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:31:48,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:31:48,111 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:31:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:31:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:31:48,112 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:31:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:31:48,113 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:31:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:31:48,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:31:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:31:48,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:31:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:31:48,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:31:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-11 02:31:48,114 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-11 02:31:48,249 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:31:48,251 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:31:49,132 INFO L? ?]: Removed 441 outVars from TransFormulas that were not future-live. [2024-10-11 02:31:49,133 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:31:49,191 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:31:49,191 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:31:49,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:49 BoogieIcfgContainer [2024-10-11 02:31:49,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:31:49,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:31:49,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:31:49,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:31:49,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:31:47" (1/3) ... [2024-10-11 02:31:49,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4069e937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:49, skipping insertion in model container [2024-10-11 02:31:49,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:47" (2/3) ... [2024-10-11 02:31:49,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4069e937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:49, skipping insertion in model container [2024-10-11 02:31:49,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:49" (3/3) ... [2024-10-11 02:31:49,200 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product20.cil.c [2024-10-11 02:31:49,212 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:31:49,212 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:31:49,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:31:49,280 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;@3395f29d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:31:49,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:31:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 399 states have (on average 1.7067669172932332) internal successors, (681), 417 states have internal predecessors, (681), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-11 02:31:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:31:49,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:49,299 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:49,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 543481051, now seen corresponding path program 1 times [2024-10-11 02:31:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:49,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239511205] [2024-10-11 02:31:49,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:31:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:31:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:31:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:31:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:31:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:31:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239511205] [2024-10-11 02:31:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239511205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:49,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:31:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174159054] [2024-10-11 02:31:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:49,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:31:49,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:49,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:31:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:31:49,987 INFO L87 Difference]: Start difference. First operand has 523 states, 399 states have (on average 1.7067669172932332) internal successors, (681), 417 states have internal predecessors, (681), 97 states have call successors, (97), 25 states have call predecessors, (97), 25 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:31:52,449 INFO L93 Difference]: Finished difference Result 1162 states and 1967 transitions. [2024-10-11 02:31:52,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:31:52,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-11 02:31:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:31:52,465 INFO L225 Difference]: With dead ends: 1162 [2024-10-11 02:31:52,465 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 02:31:52,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:31:52,479 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 626 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:31:52,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1470 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:31:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 02:31:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 522. [2024-10-11 02:31:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 399 states have (on average 1.6892230576441103) internal successors, (674), 416 states have internal predecessors, (674), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:31:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 867 transitions. [2024-10-11 02:31:52,613 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 867 transitions. Word has length 52 [2024-10-11 02:31:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:31:52,614 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 867 transitions. [2024-10-11 02:31:52,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 867 transitions. [2024-10-11 02:31:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 02:31:52,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:52,618 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:52,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:31:52,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash 870369132, now seen corresponding path program 1 times [2024-10-11 02:31:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:52,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787952432] [2024-10-11 02:31:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:31:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:31:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:31:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:31:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:31:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:31:52,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787952432] [2024-10-11 02:31:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787952432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:31:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070076835] [2024-10-11 02:31:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:31:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:31:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:31:52,882 INFO L87 Difference]: Start difference. First operand 522 states and 867 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:31:54,990 INFO L93 Difference]: Finished difference Result 1147 states and 1918 transitions. [2024-10-11 02:31:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:31:54,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2024-10-11 02:31:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:31:54,996 INFO L225 Difference]: With dead ends: 1147 [2024-10-11 02:31:54,996 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 02:31:54,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:31:54,999 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 619 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:31:54,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1447 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:31:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 02:31:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 522. [2024-10-11 02:31:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 399 states have (on average 1.68671679197995) internal successors, (673), 416 states have internal predecessors, (673), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:31:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 866 transitions. [2024-10-11 02:31:55,069 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 866 transitions. Word has length 53 [2024-10-11 02:31:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:31:55,070 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 866 transitions. [2024-10-11 02:31:55,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 866 transitions. [2024-10-11 02:31:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:31:55,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:55,071 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:55,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:31:55,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:55,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1975543159, now seen corresponding path program 1 times [2024-10-11 02:31:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:55,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215599840] [2024-10-11 02:31:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:31:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:31:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:31:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:31:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:31:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:31:55,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215599840] [2024-10-11 02:31:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215599840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:55,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:55,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:31:55,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946673972] [2024-10-11 02:31:55,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:55,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:31:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:55,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:31:55,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:31:55,273 INFO L87 Difference]: Start difference. First operand 522 states and 866 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:31:57,234 INFO L93 Difference]: Finished difference Result 1147 states and 1917 transitions. [2024-10-11 02:31:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:31:57,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 02:31:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:31:57,238 INFO L225 Difference]: With dead ends: 1147 [2024-10-11 02:31:57,238 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 02:31:57,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:31:57,241 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 617 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:31:57,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1447 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:31:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 02:31:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 522. [2024-10-11 02:31:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 399 states have (on average 1.6842105263157894) internal successors, (672), 416 states have internal predecessors, (672), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:31:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 865 transitions. [2024-10-11 02:31:57,306 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 865 transitions. Word has length 54 [2024-10-11 02:31:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:31:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 865 transitions. [2024-10-11 02:31:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 865 transitions. [2024-10-11 02:31:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:31:57,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:57,311 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:57,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:31:57,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:57,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1437777736, now seen corresponding path program 1 times [2024-10-11 02:31:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704075429] [2024-10-11 02:31:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:31:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:31:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:31:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:31:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:31:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:31:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704075429] [2024-10-11 02:31:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704075429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:57,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:57,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:31:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702491663] [2024-10-11 02:31:57,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:57,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:31:57,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:57,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:31:57,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:31:57,524 INFO L87 Difference]: Start difference. First operand 522 states and 865 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:31:59,354 INFO L93 Difference]: Finished difference Result 1147 states and 1916 transitions. [2024-10-11 02:31:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:31:59,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-10-11 02:31:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:31:59,359 INFO L225 Difference]: With dead ends: 1147 [2024-10-11 02:31:59,359 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 02:31:59,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:31:59,365 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 615 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:31:59,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1447 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:31:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 02:31:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 522. [2024-10-11 02:31:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 399 states have (on average 1.681704260651629) internal successors, (671), 416 states have internal predecessors, (671), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:31:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 864 transitions. [2024-10-11 02:31:59,432 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 864 transitions. Word has length 55 [2024-10-11 02:31:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:31:59,433 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 864 transitions. [2024-10-11 02:31:59,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:31:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 864 transitions. [2024-10-11 02:31:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:31:59,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:59,434 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:59,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:31:59,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:59,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1508496915, now seen corresponding path program 1 times [2024-10-11 02:31:59,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:59,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827530302] [2024-10-11 02:31:59,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:59,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:31:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:31:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:31:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:31:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:31:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:31:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827530302] [2024-10-11 02:31:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827530302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:31:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928759712] [2024-10-11 02:31:59,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:59,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:31:59,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:59,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:31:59,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:31:59,645 INFO L87 Difference]: Start difference. First operand 522 states and 864 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:01,487 INFO L93 Difference]: Finished difference Result 1147 states and 1915 transitions. [2024-10-11 02:32:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:32:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-11 02:32:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:01,491 INFO L225 Difference]: With dead ends: 1147 [2024-10-11 02:32:01,491 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 02:32:01,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:32:01,494 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 613 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:01,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1447 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 02:32:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 522. [2024-10-11 02:32:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 399 states have (on average 1.6791979949874687) internal successors, (670), 416 states have internal predecessors, (670), 97 states have call successors, (97), 26 states have call predecessors, (97), 25 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 863 transitions. [2024-10-11 02:32:01,538 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 863 transitions. Word has length 56 [2024-10-11 02:32:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:01,539 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 863 transitions. [2024-10-11 02:32:01,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 863 transitions. [2024-10-11 02:32:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:32:01,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:01,542 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:01,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:32:01,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:01,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1032597724, now seen corresponding path program 1 times [2024-10-11 02:32:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:01,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118991664] [2024-10-11 02:32:01,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:01,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:32:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118991664] [2024-10-11 02:32:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118991664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:01,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391855507] [2024-10-11 02:32:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:01,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:01,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:01,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:01,838 INFO L87 Difference]: Start difference. First operand 522 states and 863 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:04,597 INFO L93 Difference]: Finished difference Result 1167 states and 1949 transitions. [2024-10-11 02:32:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:32:04,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2024-10-11 02:32:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:04,601 INFO L225 Difference]: With dead ends: 1167 [2024-10-11 02:32:04,601 INFO L226 Difference]: Without dead ends: 661 [2024-10-11 02:32:04,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:32:04,604 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 704 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 3224 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:04,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 2693 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3224 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 02:32:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-11 02:32:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 534. [2024-10-11 02:32:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 408 states have (on average 1.6764705882352942) internal successors, (684), 427 states have internal predecessors, (684), 98 states have call successors, (98), 26 states have call predecessors, (98), 27 states have return successors, (100), 94 states have call predecessors, (100), 97 states have call successors, (100) [2024-10-11 02:32:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 882 transitions. [2024-10-11 02:32:04,660 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 882 transitions. Word has length 57 [2024-10-11 02:32:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:04,661 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 882 transitions. [2024-10-11 02:32:04,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 882 transitions. [2024-10-11 02:32:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:32:04,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:04,663 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:04,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:32:04,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:04,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2079022275, now seen corresponding path program 1 times [2024-10-11 02:32:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8431042] [2024-10-11 02:32:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:32:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8431042] [2024-10-11 02:32:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8431042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:04,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:04,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564415219] [2024-10-11 02:32:04,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:04,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:04,874 INFO L87 Difference]: Start difference. First operand 534 states and 882 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:06,907 INFO L93 Difference]: Finished difference Result 1218 states and 2037 transitions. [2024-10-11 02:32:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:32:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-11 02:32:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:06,912 INFO L225 Difference]: With dead ends: 1218 [2024-10-11 02:32:06,912 INFO L226 Difference]: Without dead ends: 704 [2024-10-11 02:32:06,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:06,914 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 684 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:06,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1396 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-10-11 02:32:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 553. [2024-10-11 02:32:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 426 states have (on average 1.6713615023474178) internal successors, (712), 445 states have internal predecessors, (712), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 909 transitions. [2024-10-11 02:32:06,959 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 909 transitions. Word has length 57 [2024-10-11 02:32:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:06,959 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 909 transitions. [2024-10-11 02:32:06,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 909 transitions. [2024-10-11 02:32:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:32:06,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:06,960 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:06,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:32:06,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:06,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash 915007797, now seen corresponding path program 1 times [2024-10-11 02:32:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712024857] [2024-10-11 02:32:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:32:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:32:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:07,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712024857] [2024-10-11 02:32:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712024857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:07,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677300606] [2024-10-11 02:32:07,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:07,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:07,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:07,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:07,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:07,139 INFO L87 Difference]: Start difference. First operand 553 states and 909 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:08,853 INFO L93 Difference]: Finished difference Result 1193 states and 1972 transitions. [2024-10-11 02:32:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:08,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-10-11 02:32:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:08,857 INFO L225 Difference]: With dead ends: 1193 [2024-10-11 02:32:08,858 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:32:08,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:08,861 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 672 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:08,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1403 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:32:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:32:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 553. [2024-10-11 02:32:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 426 states have (on average 1.65962441314554) internal successors, (707), 445 states have internal predecessors, (707), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 904 transitions. [2024-10-11 02:32:08,907 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 904 transitions. Word has length 58 [2024-10-11 02:32:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:08,908 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 904 transitions. [2024-10-11 02:32:08,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 904 transitions. [2024-10-11 02:32:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:32:08,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:08,908 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:08,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:32:08,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:08,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1128153272, now seen corresponding path program 1 times [2024-10-11 02:32:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325513044] [2024-10-11 02:32:08,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:32:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:32:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:32:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:32:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325513044] [2024-10-11 02:32:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325513044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565034437] [2024-10-11 02:32:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:09,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:09,084 INFO L87 Difference]: Start difference. First operand 553 states and 904 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:10,729 INFO L93 Difference]: Finished difference Result 1193 states and 1967 transitions. [2024-10-11 02:32:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:10,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2024-10-11 02:32:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:10,733 INFO L225 Difference]: With dead ends: 1193 [2024-10-11 02:32:10,733 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:32:10,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:10,735 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 671 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:10,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1403 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:32:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:32:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 553. [2024-10-11 02:32:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 426 states have (on average 1.647887323943662) internal successors, (702), 445 states have internal predecessors, (702), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 899 transitions. [2024-10-11 02:32:10,791 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 899 transitions. Word has length 59 [2024-10-11 02:32:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:10,792 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 899 transitions. [2024-10-11 02:32:10,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 899 transitions. [2024-10-11 02:32:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:32:10,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:10,793 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:10,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:32:10,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash 964856058, now seen corresponding path program 1 times [2024-10-11 02:32:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:10,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747825627] [2024-10-11 02:32:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:11,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:32:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:11,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:32:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:11,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747825627] [2024-10-11 02:32:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747825627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:11,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:11,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:11,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317264898] [2024-10-11 02:32:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:11,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:11,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:11,014 INFO L87 Difference]: Start difference. First operand 553 states and 899 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:13,495 INFO L93 Difference]: Finished difference Result 1173 states and 1928 transitions. [2024-10-11 02:32:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:13,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-10-11 02:32:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:13,498 INFO L225 Difference]: With dead ends: 1173 [2024-10-11 02:32:13,498 INFO L226 Difference]: Without dead ends: 690 [2024-10-11 02:32:13,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:13,500 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 662 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 3325 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:13,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2770 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3325 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:32:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-11 02:32:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 555. [2024-10-11 02:32:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.6425233644859814) internal successors, (703), 447 states have internal predecessors, (703), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 900 transitions. [2024-10-11 02:32:13,542 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 900 transitions. Word has length 60 [2024-10-11 02:32:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:13,542 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 900 transitions. [2024-10-11 02:32:13,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 900 transitions. [2024-10-11 02:32:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:32:13,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:13,543 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:13,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:32:13,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:13,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -360087590, now seen corresponding path program 1 times [2024-10-11 02:32:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695182759] [2024-10-11 02:32:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:32:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:32:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:13,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:13,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695182759] [2024-10-11 02:32:13,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695182759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:13,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:13,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783517907] [2024-10-11 02:32:13,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:13,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:13,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:13,712 INFO L87 Difference]: Start difference. First operand 555 states and 900 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:15,552 INFO L93 Difference]: Finished difference Result 1197 states and 1961 transitions. [2024-10-11 02:32:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:15,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-10-11 02:32:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:15,557 INFO L225 Difference]: With dead ends: 1197 [2024-10-11 02:32:15,557 INFO L226 Difference]: Without dead ends: 698 [2024-10-11 02:32:15,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:15,559 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 669 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:15,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1403 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-11 02:32:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 555. [2024-10-11 02:32:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 428 states have (on average 1.6308411214953271) internal successors, (698), 447 states have internal predecessors, (698), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 895 transitions. [2024-10-11 02:32:15,619 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 895 transitions. Word has length 60 [2024-10-11 02:32:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:15,620 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 895 transitions. [2024-10-11 02:32:15,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 895 transitions. [2024-10-11 02:32:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:32:15,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:15,621 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:32:15,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash 170244907, now seen corresponding path program 1 times [2024-10-11 02:32:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741327537] [2024-10-11 02:32:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:32:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:32:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:15,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741327537] [2024-10-11 02:32:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741327537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:15,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:15,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403695653] [2024-10-11 02:32:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:15,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:15,843 INFO L87 Difference]: Start difference. First operand 555 states and 895 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:18,298 INFO L93 Difference]: Finished difference Result 1186 states and 1935 transitions. [2024-10-11 02:32:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:18,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-10-11 02:32:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:18,302 INFO L225 Difference]: With dead ends: 1186 [2024-10-11 02:32:18,302 INFO L226 Difference]: Without dead ends: 699 [2024-10-11 02:32:18,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:18,304 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 658 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 3312 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 3421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:18,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 2743 Invalid, 3421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3312 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:32:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-11 02:32:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 561. [2024-10-11 02:32:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 434 states have (on average 1.619815668202765) internal successors, (703), 453 states have internal predecessors, (703), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 900 transitions. [2024-10-11 02:32:18,345 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 900 transitions. Word has length 61 [2024-10-11 02:32:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:18,346 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 900 transitions. [2024-10-11 02:32:18,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 900 transitions. [2024-10-11 02:32:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:32:18,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:18,347 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:18,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:32:18,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:18,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1656661453, now seen corresponding path program 1 times [2024-10-11 02:32:18,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:18,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896617403] [2024-10-11 02:32:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:32:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:32:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:18,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896617403] [2024-10-11 02:32:18,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896617403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:18,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:18,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635078853] [2024-10-11 02:32:18,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:18,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:18,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:18,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:18,534 INFO L87 Difference]: Start difference. First operand 561 states and 900 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:20,305 INFO L93 Difference]: Finished difference Result 1212 states and 1966 transitions. [2024-10-11 02:32:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:20,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2024-10-11 02:32:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:20,309 INFO L225 Difference]: With dead ends: 1212 [2024-10-11 02:32:20,309 INFO L226 Difference]: Without dead ends: 707 [2024-10-11 02:32:20,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:20,311 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 667 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:20,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1403 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:32:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-10-11 02:32:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 561. [2024-10-11 02:32:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 434 states have (on average 1.608294930875576) internal successors, (698), 453 states have internal predecessors, (698), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 895 transitions. [2024-10-11 02:32:20,367 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 895 transitions. Word has length 61 [2024-10-11 02:32:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:20,367 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 895 transitions. [2024-10-11 02:32:20,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 895 transitions. [2024-10-11 02:32:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:32:20,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:20,368 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:20,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:32:20,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:20,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1339035489, now seen corresponding path program 1 times [2024-10-11 02:32:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497541643] [2024-10-11 02:32:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:32:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:20,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:20,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497541643] [2024-10-11 02:32:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497541643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:20,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:20,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318715255] [2024-10-11 02:32:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:20,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:20,576 INFO L87 Difference]: Start difference. First operand 561 states and 895 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:22,881 INFO L93 Difference]: Finished difference Result 1201 states and 1942 transitions. [2024-10-11 02:32:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:22,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-11 02:32:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:22,884 INFO L225 Difference]: With dead ends: 1201 [2024-10-11 02:32:22,884 INFO L226 Difference]: Without dead ends: 711 [2024-10-11 02:32:22,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:22,886 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 654 mSDsluCounter, 2249 mSDsCounter, 0 mSdLazyCounter, 3294 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:22,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2716 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3294 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:32:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-11 02:32:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 569. [2024-10-11 02:32:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 442 states have (on average 1.5950226244343892) internal successors, (705), 461 states have internal predecessors, (705), 98 states have call successors, (98), 27 states have call predecessors, (98), 28 states have return successors, (99), 94 states have call predecessors, (99), 97 states have call successors, (99) [2024-10-11 02:32:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 902 transitions. [2024-10-11 02:32:22,927 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 902 transitions. Word has length 62 [2024-10-11 02:32:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:22,928 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 902 transitions. [2024-10-11 02:32:22,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 902 transitions. [2024-10-11 02:32:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:32:22,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:22,929 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:22,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:32:22,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:22,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:22,929 INFO L85 PathProgramCache]: Analyzing trace with hash -567078273, now seen corresponding path program 1 times [2024-10-11 02:32:22,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:22,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049061673] [2024-10-11 02:32:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:22,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:32:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:23,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049061673] [2024-10-11 02:32:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049061673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:23,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:23,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:32:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573692148] [2024-10-11 02:32:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:23,098 INFO L87 Difference]: Start difference. First operand 569 states and 902 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:24,816 INFO L93 Difference]: Finished difference Result 1256 states and 2006 transitions. [2024-10-11 02:32:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2024-10-11 02:32:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:24,821 INFO L225 Difference]: With dead ends: 1256 [2024-10-11 02:32:24,821 INFO L226 Difference]: Without dead ends: 681 [2024-10-11 02:32:24,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:24,822 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 613 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:24,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1500 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:32:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-11 02:32:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 551. [2024-10-11 02:32:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 427 states have (on average 1.5995316159250585) internal successors, (683), 444 states have internal predecessors, (683), 97 states have call successors, (97), 27 states have call predecessors, (97), 26 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 876 transitions. [2024-10-11 02:32:24,875 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 876 transitions. Word has length 62 [2024-10-11 02:32:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 876 transitions. [2024-10-11 02:32:24,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:32:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 876 transitions. [2024-10-11 02:32:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 02:32:24,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:24,878 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:24,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:32:24,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:24,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash 766741296, now seen corresponding path program 1 times [2024-10-11 02:32:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884308249] [2024-10-11 02:32:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:24,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:32:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:32:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884308249] [2024-10-11 02:32:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884308249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:32:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716399479] [2024-10-11 02:32:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:32:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:32:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:32:25,091 INFO L87 Difference]: Start difference. First operand 551 states and 876 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:27,461 INFO L93 Difference]: Finished difference Result 1188 states and 1913 transitions. [2024-10-11 02:32:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:27,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-10-11 02:32:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:27,465 INFO L225 Difference]: With dead ends: 1188 [2024-10-11 02:32:27,465 INFO L226 Difference]: Without dead ends: 696 [2024-10-11 02:32:27,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:27,467 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 637 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 3379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:27,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 2670 Invalid, 3379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:32:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-11 02:32:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 561. [2024-10-11 02:32:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 437 states have (on average 1.585812356979405) internal successors, (693), 454 states have internal predecessors, (693), 97 states have call successors, (97), 27 states have call predecessors, (97), 26 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:32:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 886 transitions. [2024-10-11 02:32:27,506 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 886 transitions. Word has length 63 [2024-10-11 02:32:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:27,506 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 886 transitions. [2024-10-11 02:32:27,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 886 transitions. [2024-10-11 02:32:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 02:32:27,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:27,507 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:27,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:32:27,508 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1133376940, now seen corresponding path program 1 times [2024-10-11 02:32:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960622050] [2024-10-11 02:32:27,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:27,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:32:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:32:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:32:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960622050] [2024-10-11 02:32:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960622050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:27,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:27,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:32:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427354151] [2024-10-11 02:32:27,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:27,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:32:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:32:27,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:32:27,690 INFO L87 Difference]: Start difference. First operand 561 states and 886 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:30,175 INFO L93 Difference]: Finished difference Result 1768 states and 2876 transitions. [2024-10-11 02:32:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:32:30,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2024-10-11 02:32:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:30,182 INFO L225 Difference]: With dead ends: 1768 [2024-10-11 02:32:30,182 INFO L226 Difference]: Without dead ends: 1277 [2024-10-11 02:32:30,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:32:30,183 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 1807 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:30,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 1029 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 02:32:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-10-11 02:32:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 987. [2024-10-11 02:32:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 771 states have (on average 1.6108949416342413) internal successors, (1242), 797 states have internal predecessors, (1242), 170 states have call successors, (170), 47 states have call predecessors, (170), 45 states have return successors, (175), 157 states have call predecessors, (175), 168 states have call successors, (175) [2024-10-11 02:32:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1587 transitions. [2024-10-11 02:32:30,284 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1587 transitions. Word has length 64 [2024-10-11 02:32:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:30,284 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1587 transitions. [2024-10-11 02:32:30,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:32:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1587 transitions. [2024-10-11 02:32:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:32:30,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:30,287 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:30,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:32:30,288 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:30,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash -848845766, now seen corresponding path program 1 times [2024-10-11 02:32:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:30,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905994092] [2024-10-11 02:32:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:32:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:32:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:32:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:32:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:32:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905994092] [2024-10-11 02:32:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905994092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318524866] [2024-10-11 02:32:30,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:30,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:30,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:30,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:30,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:32:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:32:31,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:32:31,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318524866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:31,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:31,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2024-10-11 02:32:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280792460] [2024-10-11 02:32:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:32:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:32:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:32:31,070 INFO L87 Difference]: Start difference. First operand 987 states and 1587 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:31,285 INFO L93 Difference]: Finished difference Result 2809 states and 4633 transitions. [2024-10-11 02:32:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:32:31,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-11 02:32:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:31,294 INFO L225 Difference]: With dead ends: 2809 [2024-10-11 02:32:31,294 INFO L226 Difference]: Without dead ends: 1893 [2024-10-11 02:32:31,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:32:31,298 INFO L432 NwaCegarLoop]: 874 mSDtfsCounter, 833 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:31,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1632 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:32:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-10-11 02:32:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1881. [2024-10-11 02:32:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1881 states, 1466 states have (on average 1.625511596180082) internal successors, (2383), 1515 states have internal predecessors, (2383), 327 states have call successors, (327), 89 states have call predecessors, (327), 87 states have return successors, (366), 306 states have call predecessors, (366), 323 states have call successors, (366) [2024-10-11 02:32:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 3076 transitions. [2024-10-11 02:32:31,470 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 3076 transitions. Word has length 115 [2024-10-11 02:32:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 1881 states and 3076 transitions. [2024-10-11 02:32:31,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3076 transitions. [2024-10-11 02:32:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:32:31,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:31,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:31,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:32:31,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 02:32:31,674 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:31,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2124249449, now seen corresponding path program 1 times [2024-10-11 02:32:31,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:31,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417788281] [2024-10-11 02:32:31,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:32:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:32:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:32:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:32:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 02:32:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:32,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417788281] [2024-10-11 02:32:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417788281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240782178] [2024-10-11 02:32:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:32,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:32,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:32,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:32,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:32:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:32,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:32:32,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:32,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240782178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:32,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:32,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-11 02:32:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411710564] [2024-10-11 02:32:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:32,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:32:32,528 INFO L87 Difference]: Start difference. First operand 1881 states and 3076 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:32:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:33,193 INFO L93 Difference]: Finished difference Result 4740 states and 7794 transitions. [2024-10-11 02:32:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-11 02:32:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:33,205 INFO L225 Difference]: With dead ends: 4740 [2024-10-11 02:32:33,205 INFO L226 Difference]: Without dead ends: 2929 [2024-10-11 02:32:33,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:32:33,211 INFO L432 NwaCegarLoop]: 1092 mSDtfsCounter, 793 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 4280 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:33,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 4280 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2024-10-11 02:32:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2927. [2024-10-11 02:32:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2278 states have (on average 1.593064091308165) internal successors, (3629), 2331 states have internal predecessors, (3629), 501 states have call successors, (501), 151 states have call predecessors, (501), 147 states have return successors, (632), 476 states have call predecessors, (632), 493 states have call successors, (632) [2024-10-11 02:32:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4762 transitions. [2024-10-11 02:32:33,489 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4762 transitions. Word has length 114 [2024-10-11 02:32:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:33,490 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 4762 transitions. [2024-10-11 02:32:33,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:32:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4762 transitions. [2024-10-11 02:32:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:32:33,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:33,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:33,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:32:33,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:33,693 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:33,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash 536646330, now seen corresponding path program 1 times [2024-10-11 02:32:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:33,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980984737] [2024-10-11 02:32:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:32:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:32:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:32:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:32:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:32:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:34,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980984737] [2024-10-11 02:32:34,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980984737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:34,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309198548] [2024-10-11 02:32:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:34,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:34,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:34,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:34,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:32:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:34,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:34,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:32:34,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309198548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:34,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:34,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-10-11 02:32:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046959941] [2024-10-11 02:32:34,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:34,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:34,454 INFO L87 Difference]: Start difference. First operand 2927 states and 4762 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:35,138 INFO L93 Difference]: Finished difference Result 5848 states and 9849 transitions. [2024-10-11 02:32:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:35,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-11 02:32:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:35,153 INFO L225 Difference]: With dead ends: 5848 [2024-10-11 02:32:35,154 INFO L226 Difference]: Without dead ends: 2991 [2024-10-11 02:32:35,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:32:35,171 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 788 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:35,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2019 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2024-10-11 02:32:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2991. [2024-10-11 02:32:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2334 states have (on average 1.5959725792630677) internal successors, (3725), 2387 states have internal predecessors, (3725), 501 states have call successors, (501), 159 states have call predecessors, (501), 155 states have return successors, (640), 476 states have call predecessors, (640), 493 states have call successors, (640) [2024-10-11 02:32:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 4866 transitions. [2024-10-11 02:32:35,474 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 4866 transitions. Word has length 115 [2024-10-11 02:32:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 4866 transitions. [2024-10-11 02:32:35,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 4866 transitions. [2024-10-11 02:32:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:32:35,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:35,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:35,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:32:35,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:35,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:35,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash 898157510, now seen corresponding path program 1 times [2024-10-11 02:32:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003311355] [2024-10-11 02:32:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:32:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:32:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:32:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:32:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:32:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:32:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 02:32:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003311355] [2024-10-11 02:32:36,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003311355] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373101789] [2024-10-11 02:32:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:36,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:36,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:36,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:36,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:32:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:36,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:32:36,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373101789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 02:32:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434248155] [2024-10-11 02:32:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:36,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:32:36,376 INFO L87 Difference]: Start difference. First operand 2991 states and 4866 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:37,004 INFO L93 Difference]: Finished difference Result 5976 states and 10033 transitions. [2024-10-11 02:32:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:37,004 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-10-11 02:32:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:37,019 INFO L225 Difference]: With dead ends: 5976 [2024-10-11 02:32:37,019 INFO L226 Difference]: Without dead ends: 3055 [2024-10-11 02:32:37,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:37,031 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 779 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:37,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 2016 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-10-11 02:32:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3055. [2024-10-11 02:32:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 2390 states have (on average 1.598744769874477) internal successors, (3821), 2443 states have internal predecessors, (3821), 501 states have call successors, (501), 167 states have call predecessors, (501), 163 states have return successors, (648), 476 states have call predecessors, (648), 493 states have call successors, (648) [2024-10-11 02:32:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 4970 transitions. [2024-10-11 02:32:37,351 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 4970 transitions. Word has length 118 [2024-10-11 02:32:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:37,351 INFO L471 AbstractCegarLoop]: Abstraction has 3055 states and 4970 transitions. [2024-10-11 02:32:37,352 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 4970 transitions. [2024-10-11 02:32:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 02:32:37,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:37,354 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:37,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:32:37,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 02:32:37,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:37,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash -554244810, now seen corresponding path program 1 times [2024-10-11 02:32:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:37,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584619235] [2024-10-11 02:32:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:32:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:32:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:32:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:32:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:32:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:32:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:32:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:32:38,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:38,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584619235] [2024-10-11 02:32:38,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584619235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:38,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167973918] [2024-10-11 02:32:38,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:38,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:38,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:38,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:32:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:38,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:38,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:32:38,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:38,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167973918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:38,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 02:32:38,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496854355] [2024-10-11 02:32:38,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:38,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:38,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:38,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:32:38,309 INFO L87 Difference]: Start difference. First operand 3055 states and 4970 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:38,969 INFO L93 Difference]: Finished difference Result 6104 states and 10217 transitions. [2024-10-11 02:32:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:38,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2024-10-11 02:32:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:38,984 INFO L225 Difference]: With dead ends: 6104 [2024-10-11 02:32:38,984 INFO L226 Difference]: Without dead ends: 3119 [2024-10-11 02:32:38,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:38,995 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 783 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:38,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2013 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2024-10-11 02:32:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3119. [2024-10-11 02:32:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 2446 states have (on average 1.6013900245298447) internal successors, (3917), 2499 states have internal predecessors, (3917), 501 states have call successors, (501), 175 states have call predecessors, (501), 171 states have return successors, (656), 476 states have call predecessors, (656), 493 states have call successors, (656) [2024-10-11 02:32:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 5074 transitions. [2024-10-11 02:32:39,282 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 5074 transitions. Word has length 121 [2024-10-11 02:32:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:39,282 INFO L471 AbstractCegarLoop]: Abstraction has 3119 states and 5074 transitions. [2024-10-11 02:32:39,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 5074 transitions. [2024-10-11 02:32:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:32:39,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:39,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:39,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 02:32:39,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 02:32:39,486 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:39,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 408174650, now seen corresponding path program 1 times [2024-10-11 02:32:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:39,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276935958] [2024-10-11 02:32:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:32:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:32:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:32:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:32:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:32:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:32:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 02:32:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276935958] [2024-10-11 02:32:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276935958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:39,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273800642] [2024-10-11 02:32:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:39,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:39,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:39,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:39,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:32:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:40,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:40,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 02:32:40,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273800642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 02:32:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702951733] [2024-10-11 02:32:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:32:40,176 INFO L87 Difference]: Start difference. First operand 3119 states and 5074 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:40,787 INFO L93 Difference]: Finished difference Result 6232 states and 10401 transitions. [2024-10-11 02:32:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:40,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2024-10-11 02:32:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:40,802 INFO L225 Difference]: With dead ends: 6232 [2024-10-11 02:32:40,803 INFO L226 Difference]: Without dead ends: 3183 [2024-10-11 02:32:40,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:40,816 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 762 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:40,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2010 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:32:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2024-10-11 02:32:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 3183. [2024-10-11 02:32:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 2502 states have (on average 1.6039168665067947) internal successors, (4013), 2555 states have internal predecessors, (4013), 501 states have call successors, (501), 183 states have call predecessors, (501), 179 states have return successors, (664), 476 states have call predecessors, (664), 493 states have call successors, (664) [2024-10-11 02:32:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 5178 transitions. [2024-10-11 02:32:41,117 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 5178 transitions. Word has length 124 [2024-10-11 02:32:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:41,117 INFO L471 AbstractCegarLoop]: Abstraction has 3183 states and 5178 transitions. [2024-10-11 02:32:41,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:32:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 5178 transitions. [2024-10-11 02:32:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:32:41,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:41,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:41,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:32:41,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 02:32:41,322 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:41,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1278121550, now seen corresponding path program 1 times [2024-10-11 02:32:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011086280] [2024-10-11 02:32:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:41,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:32:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:42,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:42,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:32:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:42,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:32:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:42,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:32:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:32:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:42,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011086280] [2024-10-11 02:32:42,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011086280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998077956] [2024-10-11 02:32:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:42,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:42,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:42,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:32:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:42,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:32:42,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:32:42,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998077956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:42,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2024-10-11 02:32:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666441025] [2024-10-11 02:32:42,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:42,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:42,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:42,364 INFO L87 Difference]: Start difference. First operand 3183 states and 5178 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-11 02:32:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:43,816 INFO L93 Difference]: Finished difference Result 6524 states and 10655 transitions. [2024-10-11 02:32:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:43,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 127 [2024-10-11 02:32:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:43,831 INFO L225 Difference]: With dead ends: 6524 [2024-10-11 02:32:43,831 INFO L226 Difference]: Without dead ends: 3416 [2024-10-11 02:32:43,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:32:43,840 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 1412 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:43,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 984 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:32:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2024-10-11 02:32:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3170. [2024-10-11 02:32:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 2384 states have (on average 1.5666946308724832) internal successors, (3735), 2475 states have internal predecessors, (3735), 606 states have call successors, (606), 169 states have call predecessors, (606), 179 states have return successors, (746), 577 states have call predecessors, (746), 598 states have call successors, (746) [2024-10-11 02:32:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 5087 transitions. [2024-10-11 02:32:44,162 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 5087 transitions. Word has length 127 [2024-10-11 02:32:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:44,162 INFO L471 AbstractCegarLoop]: Abstraction has 3170 states and 5087 transitions. [2024-10-11 02:32:44,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-11 02:32:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 5087 transitions. [2024-10-11 02:32:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:32:44,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:44,166 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:44,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 02:32:44,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:44,367 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1957393804, now seen corresponding path program 1 times [2024-10-11 02:32:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590808737] [2024-10-11 02:32:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:32:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:32:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:32:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:32:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:32:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590808737] [2024-10-11 02:32:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590808737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460046610] [2024-10-11 02:32:44,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:44,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:44,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:44,936 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:32:44,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:32:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:45,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:32:45,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:32:45,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:45,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460046610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:45,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:45,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2024-10-11 02:32:45,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509356098] [2024-10-11 02:32:45,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:45,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:32:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:45,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:32:45,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:32:45,244 INFO L87 Difference]: Start difference. First operand 3170 states and 5087 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:32:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:48,359 INFO L93 Difference]: Finished difference Result 8351 states and 13729 transitions. [2024-10-11 02:32:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:32:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2024-10-11 02:32:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:48,387 INFO L225 Difference]: With dead ends: 8351 [2024-10-11 02:32:48,387 INFO L226 Difference]: Without dead ends: 5253 [2024-10-11 02:32:48,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:32:48,401 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 2634 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 5777 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2732 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 6466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 5777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:48,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2732 Valid, 1948 Invalid, 6466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 5777 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2024-10-11 02:32:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4873. [2024-10-11 02:32:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 3618 states have (on average 1.5685461580983968) internal successors, (5675), 3772 states have internal predecessors, (5675), 962 states have call successors, (962), 243 states have call predecessors, (962), 292 states have return successors, (1306), 934 states have call predecessors, (1306), 954 states have call successors, (1306) [2024-10-11 02:32:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 7943 transitions. [2024-10-11 02:32:49,104 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 7943 transitions. Word has length 127 [2024-10-11 02:32:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:49,105 INFO L471 AbstractCegarLoop]: Abstraction has 4873 states and 7943 transitions. [2024-10-11 02:32:49,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:32:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 7943 transitions. [2024-10-11 02:32:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 02:32:49,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:49,107 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:49,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 02:32:49,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 02:32:49,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:49,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1076157685, now seen corresponding path program 1 times [2024-10-11 02:32:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26131655] [2024-10-11 02:32:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:32:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:32:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:32:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:32:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:32:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 02:32:49,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:49,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26131655] [2024-10-11 02:32:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26131655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:49,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:49,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:32:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488271619] [2024-10-11 02:32:49,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:49,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:32:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:49,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:32:49,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:49,840 INFO L87 Difference]: Start difference. First operand 4873 states and 7943 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:33:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:02,936 INFO L93 Difference]: Finished difference Result 23069 states and 39457 transitions. [2024-10-11 02:33:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 02:33:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 131 [2024-10-11 02:33:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:03,023 INFO L225 Difference]: With dead ends: 23069 [2024-10-11 02:33:03,023 INFO L226 Difference]: Without dead ends: 18272 [2024-10-11 02:33:03,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2024-10-11 02:33:03,047 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 5012 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 5066 mSolverCounterSat, 1951 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5072 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 7017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1951 IncrementalHoareTripleChecker+Valid, 5066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:03,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5072 Valid, 1761 Invalid, 7017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1951 Valid, 5066 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-10-11 02:33:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18272 states. [2024-10-11 02:33:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18272 to 4927. [2024-10-11 02:33:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4927 states, 3654 states have (on average 1.5659551176792557) internal successors, (5722), 3806 states have internal predecessors, (5722), 977 states have call successors, (977), 243 states have call predecessors, (977), 295 states have return successors, (1310), 949 states have call predecessors, (1310), 969 states have call successors, (1310) [2024-10-11 02:33:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4927 states to 4927 states and 8009 transitions. [2024-10-11 02:33:04,382 INFO L78 Accepts]: Start accepts. Automaton has 4927 states and 8009 transitions. Word has length 131 [2024-10-11 02:33:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:04,382 INFO L471 AbstractCegarLoop]: Abstraction has 4927 states and 8009 transitions. [2024-10-11 02:33:04,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 02:33:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4927 states and 8009 transitions. [2024-10-11 02:33:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 02:33:04,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:04,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:33:04,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 02:33:04,385 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1003771127, now seen corresponding path program 1 times [2024-10-11 02:33:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917475506] [2024-10-11 02:33:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:33:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:33:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:33:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:33:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:33:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:33:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:33:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:33:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:33:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917475506] [2024-10-11 02:33:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917475506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796242195] [2024-10-11 02:33:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:04,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:04,933 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:33:04,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 02:33:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:05,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:33:05,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:33:05,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796242195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:05,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:05,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2024-10-11 02:33:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335617658] [2024-10-11 02:33:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:05,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:33:05,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:33:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:33:05,261 INFO L87 Difference]: Start difference. First operand 4927 states and 8009 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:33:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:06,266 INFO L93 Difference]: Finished difference Result 4929 states and 8010 transitions. [2024-10-11 02:33:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:33:06,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-11 02:33:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:06,288 INFO L225 Difference]: With dead ends: 4929 [2024-10-11 02:33:06,288 INFO L226 Difference]: Without dead ends: 4927 [2024-10-11 02:33:06,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:33:06,291 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 348 mSDsluCounter, 3219 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 4124 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:06,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 4124 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:33:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2024-10-11 02:33:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4927. [2024-10-11 02:33:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4927 states, 3654 states have (on average 1.5585659551176791) internal successors, (5695), 3806 states have internal predecessors, (5695), 977 states have call successors, (977), 243 states have call predecessors, (977), 295 states have return successors, (1310), 949 states have call predecessors, (1310), 969 states have call successors, (1310) [2024-10-11 02:33:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4927 states to 4927 states and 7982 transitions. [2024-10-11 02:33:07,230 INFO L78 Accepts]: Start accepts. Automaton has 4927 states and 7982 transitions. Word has length 131 [2024-10-11 02:33:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:07,230 INFO L471 AbstractCegarLoop]: Abstraction has 4927 states and 7982 transitions. [2024-10-11 02:33:07,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:33:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4927 states and 7982 transitions. [2024-10-11 02:33:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 02:33:07,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:07,234 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:33:07,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 02:33:07,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:07,438 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:07,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1241862531, now seen corresponding path program 1 times [2024-10-11 02:33:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9978012] [2024-10-11 02:33:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:07,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:33:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:33:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:33:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:33:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:33:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:33:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:33:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:33:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:33:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:33:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 02:33:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 02:33:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-11 02:33:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9978012] [2024-10-11 02:33:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9978012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:07,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:33:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:33:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452135746] [2024-10-11 02:33:07,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:07,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:33:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:07,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:33:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:33:07,930 INFO L87 Difference]: Start difference. First operand 4927 states and 7982 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18)