./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_product23.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_product23.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 8e3e095c3e35754b69c5b770f69d2f55696576eebdd6e61f09ab7280f663a93f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:31:47,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:31:47,826 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:47,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:31:47,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:31:47,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:31:47,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:31:47,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:31:47,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:31:47,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:31:47,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:31:47,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:31:47,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:31:47,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:31:47,885 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:31:47,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:31:47,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:31:47,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:31:47,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:31:47,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:31:47,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:31:47,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:31:47,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:31:47,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:31:47,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:31:47,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:31:47,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:31:47,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:31:47,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:31:47,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:31:47,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:31:47,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:31:47,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:47,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:31:47,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:31:47,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:31:47,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:31:47,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:31:47,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:31:47,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:31:47,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:31:47,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:31:47,894 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 -> 8e3e095c3e35754b69c5b770f69d2f55696576eebdd6e61f09ab7280f663a93f [2024-10-11 02:31:48,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:31:48,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:31:48,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:31:48,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:31:48,185 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:31:48,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product23.cil.c [2024-10-11 02:31:49,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:31:49,965 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:31:49,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product23.cil.c [2024-10-11 02:31:49,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d6ce13681/3d8b201864b4423cb6fa9bb3f6a8aba2/FLAG1b135b448 [2024-10-11 02:31:50,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d6ce13681/3d8b201864b4423cb6fa9bb3f6a8aba2 [2024-10-11 02:31:50,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:31:50,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:31:50,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:50,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:31:50,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:31:50,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:50" (1/1) ... [2024-10-11 02:31:50,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a016e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:50, skipping insertion in model container [2024-10-11 02:31:50,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:31:50" (1/1) ... [2024-10-11 02:31:50,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:31:50,400 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_product23.cil.c[8585,8598] [2024-10-11 02:31:50,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:50,672 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:31:50,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-11 02:31:50,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [408] [2024-10-11 02:31:50,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [503] [2024-10-11 02:31:50,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [544] [2024-10-11 02:31:50,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [553] [2024-10-11 02:31:50,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [919] [2024-10-11 02:31:50,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1586] [2024-10-11 02:31:50,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3177] [2024-10-11 02:31:50,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3295] [2024-10-11 02:31:50,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3330] [2024-10-11 02:31:50,704 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_product23.cil.c[8585,8598] [2024-10-11 02:31:50,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:31:50,837 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:31:50,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:50 WrapperNode [2024-10-11 02:31:50,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:31:50,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:50,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:31:50,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:31:50,847 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:50" (1/1) ... [2024-10-11 02:31:50,876 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:50" (1/1) ... [2024-10-11 02:31:50,922 INFO L138 Inliner]: procedures = 93, calls = 340, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 853 [2024-10-11 02:31:50,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:31:50,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:31:50,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:31:50,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:31:50,946 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:50" (1/1) ... [2024-10-11 02:31:50,946 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:50" (1/1) ... [2024-10-11 02:31:50,961 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:50" (1/1) ... [2024-10-11 02:31:51,003 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:51,004 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:50" (1/1) ... [2024-10-11 02:31:51,004 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:50" (1/1) ... [2024-10-11 02:31:51,021 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:50" (1/1) ... [2024-10-11 02:31:51,040 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:50" (1/1) ... [2024-10-11 02:31:51,045 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:50" (1/1) ... [2024-10-11 02:31:51,051 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:50" (1/1) ... [2024-10-11 02:31:51,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:31:51,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:31:51,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:31:51,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:31:51,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:50" (1/1) ... [2024-10-11 02:31:51,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:31:51,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:31:51,100 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:51,104 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:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:31:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:31:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:31:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:31:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:31:51,232 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:31:51,232 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:31:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:31:51,234 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:31:51,234 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:31:51,234 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:31:51,234 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:31:51,234 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:31:51,234 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:31:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:31:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:31:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:31:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:31:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:31:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:31:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:31:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:31:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:31:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:31:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:31:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:31:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:31:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:31:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:31:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:31:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:31:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:31:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:31:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:31:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:31:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:31:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:31:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:31:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:31:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:31:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:31:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:31:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:31:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:31:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:31:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:31:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:31:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:31:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:31:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:31:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:31:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:31:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:31:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:31:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:31:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:31:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:31:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:31:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:31:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:31:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:31:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:31:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:31:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:31:51,243 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:31:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:31:51,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:31:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:31:51,243 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:31:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:31:51,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:31:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:31:51,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:31:51,460 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:31:51,464 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:31:52,643 INFO L? ?]: Removed 462 outVars from TransFormulas that were not future-live. [2024-10-11 02:31:52,644 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:31:52,729 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:31:52,729 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:31:52,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:52 BoogieIcfgContainer [2024-10-11 02:31:52,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:31:52,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:31:52,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:31:52,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:31:52,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:31:50" (1/3) ... [2024-10-11 02:31:52,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c51371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:52, skipping insertion in model container [2024-10-11 02:31:52,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:31:50" (2/3) ... [2024-10-11 02:31:52,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c51371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:31:52, skipping insertion in model container [2024-10-11 02:31:52,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:31:52" (3/3) ... [2024-10-11 02:31:52,738 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product23.cil.c [2024-10-11 02:31:52,752 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:31:52,753 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:31:52,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:31:52,841 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;@25e834dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:31:52,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:31:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 537 states, 411 states have (on average 1.7007299270072993) internal successors, (699), 427 states have internal predecessors, (699), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 02:31:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:31:52,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:52,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:52,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:52,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash -712473379, now seen corresponding path program 1 times [2024-10-11 02:31:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965766473] [2024-10-11 02:31:52,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:31:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:31:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:31:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:31:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:31:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:31:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:31:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:31:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:31:53,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:53,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965766473] [2024-10-11 02:31:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965766473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:53,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:31:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905619295] [2024-10-11 02:31:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:53,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:31:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:31:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:31:53,852 INFO L87 Difference]: Start difference. First operand has 537 states, 411 states have (on average 1.7007299270072993) internal successors, (699), 427 states have internal predecessors, (699), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:31:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:31:58,234 INFO L93 Difference]: Finished difference Result 1261 states and 2140 transitions. [2024-10-11 02:31:58,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:31:58,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-10-11 02:31:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:31:58,254 INFO L225 Difference]: With dead ends: 1261 [2024-10-11 02:31:58,254 INFO L226 Difference]: Without dead ends: 718 [2024-10-11 02:31:58,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:31:58,265 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 1336 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:31:58,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1092 Invalid, 2947 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [402 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:31:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-11 02:31:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 536. [2024-10-11 02:31:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 411 states have (on average 1.683698296836983) internal successors, (692), 426 states have internal predecessors, (692), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:31:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 889 transitions. [2024-10-11 02:31:58,469 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 889 transitions. Word has length 89 [2024-10-11 02:31:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:31:58,470 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 889 transitions. [2024-10-11 02:31:58,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:31:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 889 transitions. [2024-10-11 02:31:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:31:58,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:31:58,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:31:58,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:31:58,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:31:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:31:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash -700590897, now seen corresponding path program 1 times [2024-10-11 02:31:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:31:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823946762] [2024-10-11 02:31:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:31:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:31:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:31:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:31:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:31:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:31:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:31:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:31:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:31:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:31:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:31:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:31:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:31:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:31:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:31:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823946762] [2024-10-11 02:31:58,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823946762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:31:58,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:31:58,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:31:58,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27929347] [2024-10-11 02:31:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:31:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:31:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:31:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:31:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:31:58,881 INFO L87 Difference]: Start difference. First operand 536 states and 889 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:02,575 INFO L93 Difference]: Finished difference Result 1242 states and 2074 transitions. [2024-10-11 02:32:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-10-11 02:32:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:02,581 INFO L225 Difference]: With dead ends: 1242 [2024-10-11 02:32:02,581 INFO L226 Difference]: Without dead ends: 718 [2024-10-11 02:32:02,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:02,586 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1327 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:02,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 1027 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:32:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-11 02:32:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 536. [2024-10-11 02:32:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 411 states have (on average 1.6812652068126521) internal successors, (691), 426 states have internal predecessors, (691), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 888 transitions. [2024-10-11 02:32:02,721 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 888 transitions. Word has length 90 [2024-10-11 02:32:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:02,722 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 888 transitions. [2024-10-11 02:32:02,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 888 transitions. [2024-10-11 02:32:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:32:02,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:02,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:02,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:32:02,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:02,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1977488863, now seen corresponding path program 1 times [2024-10-11 02:32:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636436585] [2024-10-11 02:32:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:32:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:32:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:32:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:32:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:32:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:32:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:32:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636436585] [2024-10-11 02:32:03,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636436585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:03,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:03,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:03,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644612223] [2024-10-11 02:32:03,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:03,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:03,082 INFO L87 Difference]: Start difference. First operand 536 states and 888 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:06,228 INFO L93 Difference]: Finished difference Result 1242 states and 2073 transitions. [2024-10-11 02:32:06,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:06,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2024-10-11 02:32:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:06,234 INFO L225 Difference]: With dead ends: 1242 [2024-10-11 02:32:06,234 INFO L226 Difference]: Without dead ends: 718 [2024-10-11 02:32:06,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:06,239 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1321 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:06,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 1035 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:32:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-11 02:32:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 536. [2024-10-11 02:32:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 411 states have (on average 1.6788321167883211) internal successors, (690), 426 states have internal predecessors, (690), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 887 transitions. [2024-10-11 02:32:06,332 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 887 transitions. Word has length 91 [2024-10-11 02:32:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:06,332 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 887 transitions. [2024-10-11 02:32:06,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 887 transitions. [2024-10-11 02:32:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:32:06,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:06,335 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:06,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:32:06,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash -256907757, now seen corresponding path program 1 times [2024-10-11 02:32:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542750529] [2024-10-11 02:32:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:32:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:32:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:32:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:32:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:32:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:32:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:32:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:06,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:06,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542750529] [2024-10-11 02:32:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542750529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:06,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256120976] [2024-10-11 02:32:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:06,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:06,715 INFO L87 Difference]: Start difference. First operand 536 states and 887 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:10,179 INFO L93 Difference]: Finished difference Result 1242 states and 2072 transitions. [2024-10-11 02:32:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:10,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2024-10-11 02:32:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:10,185 INFO L225 Difference]: With dead ends: 1242 [2024-10-11 02:32:10,185 INFO L226 Difference]: Without dead ends: 718 [2024-10-11 02:32:10,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:10,190 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1316 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:10,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1042 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:32:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-11 02:32:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 536. [2024-10-11 02:32:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 411 states have (on average 1.6763990267639903) internal successors, (689), 426 states have internal predecessors, (689), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 886 transitions. [2024-10-11 02:32:10,282 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 886 transitions. Word has length 92 [2024-10-11 02:32:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:10,283 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 886 transitions. [2024-10-11 02:32:10,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 886 transitions. [2024-10-11 02:32:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:32:10,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:10,286 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:10,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:32:10,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:10,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash -103755931, now seen corresponding path program 1 times [2024-10-11 02:32:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:10,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701390681] [2024-10-11 02:32:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:10,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:32:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:32:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:32:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:32:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:32:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:32:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701390681] [2024-10-11 02:32:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701390681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:10,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261614212] [2024-10-11 02:32:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:10,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:10,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:10,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:10,650 INFO L87 Difference]: Start difference. First operand 536 states and 886 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:13,672 INFO L93 Difference]: Finished difference Result 1242 states and 2071 transitions. [2024-10-11 02:32:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:32:13,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2024-10-11 02:32:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:13,677 INFO L225 Difference]: With dead ends: 1242 [2024-10-11 02:32:13,677 INFO L226 Difference]: Without dead ends: 718 [2024-10-11 02:32:13,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:13,680 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1329 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:13,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 988 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-11 02:32:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 536. [2024-10-11 02:32:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 411 states have (on average 1.6739659367396593) internal successors, (688), 426 states have internal predecessors, (688), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 885 transitions. [2024-10-11 02:32:13,783 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 885 transitions. Word has length 93 [2024-10-11 02:32:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:13,784 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 885 transitions. [2024-10-11 02:32:13,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 885 transitions. [2024-10-11 02:32:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:32:13,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:13,787 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:13,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:32:13,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:13,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1296271529, now seen corresponding path program 1 times [2024-10-11 02:32:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373417384] [2024-10-11 02:32:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:32:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:32:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:32:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:32:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:32:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373417384] [2024-10-11 02:32:14,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373417384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:14,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319207128] [2024-10-11 02:32:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:14,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:14,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:14,175 INFO L87 Difference]: Start difference. First operand 536 states and 885 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:17,535 INFO L93 Difference]: Finished difference Result 1277 states and 2130 transitions. [2024-10-11 02:32:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:17,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2024-10-11 02:32:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:17,540 INFO L225 Difference]: With dead ends: 1277 [2024-10-11 02:32:17,541 INFO L226 Difference]: Without dead ends: 757 [2024-10-11 02:32:17,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:17,544 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1388 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:17,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 1069 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 02:32:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-11 02:32:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 555. [2024-10-11 02:32:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 429 states have (on average 1.668997668997669) internal successors, (716), 444 states have internal predecessors, (716), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 913 transitions. [2024-10-11 02:32:17,665 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 913 transitions. Word has length 94 [2024-10-11 02:32:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:17,666 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 913 transitions. [2024-10-11 02:32:17,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 913 transitions. [2024-10-11 02:32:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:32:17,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:17,669 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:17,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:32:17,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:17,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2129058570, now seen corresponding path program 1 times [2024-10-11 02:32:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:17,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435497486] [2024-10-11 02:32:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:32:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:32:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:32:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:32:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:32:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:32:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435497486] [2024-10-11 02:32:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435497486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:17,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216758811] [2024-10-11 02:32:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:17,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:17,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:17,992 INFO L87 Difference]: Start difference. First operand 555 states and 913 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:20,822 INFO L93 Difference]: Finished difference Result 1260 states and 2080 transitions. [2024-10-11 02:32:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-11 02:32:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:20,827 INFO L225 Difference]: With dead ends: 1260 [2024-10-11 02:32:20,828 INFO L226 Difference]: Without dead ends: 757 [2024-10-11 02:32:20,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:20,831 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1376 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:20,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 1028 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-11 02:32:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 555. [2024-10-11 02:32:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 429 states have (on average 1.6573426573426573) internal successors, (711), 444 states have internal predecessors, (711), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 908 transitions. [2024-10-11 02:32:20,928 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 908 transitions. Word has length 95 [2024-10-11 02:32:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:20,929 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 908 transitions. [2024-10-11 02:32:20,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 908 transitions. [2024-10-11 02:32:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:32:20,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:20,933 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:20,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:32:20,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:20,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2105749358, now seen corresponding path program 1 times [2024-10-11 02:32:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926783948] [2024-10-11 02:32:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:32:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:32:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:32:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:32:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:21,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:21,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926783948] [2024-10-11 02:32:21,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926783948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:21,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:32:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348959955] [2024-10-11 02:32:21,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:21,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:32:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:32:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:21,323 INFO L87 Difference]: Start difference. First operand 555 states and 908 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:25,486 INFO L93 Difference]: Finished difference Result 1272 states and 2096 transitions. [2024-10-11 02:32:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 02:32:25,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2024-10-11 02:32:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:25,491 INFO L225 Difference]: With dead ends: 1272 [2024-10-11 02:32:25,491 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 02:32:25,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:32:25,493 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 1416 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 4827 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 5235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 4827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:25,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 1879 Invalid, 5235 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [408 Valid, 4827 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:32:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 02:32:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 567. [2024-10-11 02:32:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 438 states have (on average 1.6552511415525115) internal successors, (725), 455 states have internal predecessors, (725), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:32:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 926 transitions. [2024-10-11 02:32:25,601 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 926 transitions. Word has length 96 [2024-10-11 02:32:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:25,602 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 926 transitions. [2024-10-11 02:32:25,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 926 transitions. [2024-10-11 02:32:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:32:25,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:25,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:25,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:32:25,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:25,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash 979975699, now seen corresponding path program 1 times [2024-10-11 02:32:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800381781] [2024-10-11 02:32:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:32:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:32:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:32:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:32:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:32:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:32:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800381781] [2024-10-11 02:32:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800381781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531108165] [2024-10-11 02:32:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:25,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:25,906 INFO L87 Difference]: Start difference. First operand 567 states and 926 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:28,723 INFO L93 Difference]: Finished difference Result 1288 states and 2123 transitions. [2024-10-11 02:32:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-10-11 02:32:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:28,728 INFO L225 Difference]: With dead ends: 1288 [2024-10-11 02:32:28,728 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 02:32:28,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:28,731 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1373 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 2499 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:28,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1011 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2499 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 02:32:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 567. [2024-10-11 02:32:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 438 states have (on average 1.643835616438356) internal successors, (720), 455 states have internal predecessors, (720), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:32:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 921 transitions. [2024-10-11 02:32:28,842 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 921 transitions. Word has length 96 [2024-10-11 02:32:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:28,843 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 921 transitions. [2024-10-11 02:32:28,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 921 transitions. [2024-10-11 02:32:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:32:28,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:28,845 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:28,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:32:28,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:28,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1547099236, now seen corresponding path program 1 times [2024-10-11 02:32:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:28,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800768644] [2024-10-11 02:32:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:32:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:32:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:32:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800768644] [2024-10-11 02:32:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800768644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:32:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667876705] [2024-10-11 02:32:29,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:29,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:32:29,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:32:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:29,175 INFO L87 Difference]: Start difference. First operand 567 states and 921 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:33,131 INFO L93 Difference]: Finished difference Result 1268 states and 2084 transitions. [2024-10-11 02:32:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:32:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-10-11 02:32:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:33,135 INFO L225 Difference]: With dead ends: 1268 [2024-10-11 02:32:33,135 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 02:32:33,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:33,137 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1363 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 4732 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 4732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:33,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 1890 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 4732 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:32:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 02:32:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 569. [2024-10-11 02:32:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 440 states have (on average 1.6386363636363637) internal successors, (721), 457 states have internal predecessors, (721), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:32:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 922 transitions. [2024-10-11 02:32:33,251 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 922 transitions. Word has length 97 [2024-10-11 02:32:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:33,251 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 922 transitions. [2024-10-11 02:32:33,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 922 transitions. [2024-10-11 02:32:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:32:33,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:33,254 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:33,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:32:33,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:33,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2118471292, now seen corresponding path program 1 times [2024-10-11 02:32:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376155950] [2024-10-11 02:32:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:33,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:32:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:32:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:32:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:32:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:32:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:32:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376155950] [2024-10-11 02:32:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376155950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125493246] [2024-10-11 02:32:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:33,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:33,526 INFO L87 Difference]: Start difference. First operand 569 states and 922 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:36,352 INFO L93 Difference]: Finished difference Result 1292 states and 2117 transitions. [2024-10-11 02:32:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:36,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2024-10-11 02:32:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:36,356 INFO L225 Difference]: With dead ends: 1292 [2024-10-11 02:32:36,357 INFO L226 Difference]: Without dead ends: 779 [2024-10-11 02:32:36,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:36,359 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1361 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:36,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 1040 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:36,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-11 02:32:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 569. [2024-10-11 02:32:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 440 states have (on average 1.6272727272727272) internal successors, (716), 457 states have internal predecessors, (716), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:32:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 917 transitions. [2024-10-11 02:32:36,467 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 917 transitions. Word has length 97 [2024-10-11 02:32:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:36,467 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 917 transitions. [2024-10-11 02:32:36,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 917 transitions. [2024-10-11 02:32:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:32:36,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:36,470 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:36,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:32:36,471 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:36,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1355604880, now seen corresponding path program 1 times [2024-10-11 02:32:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366061657] [2024-10-11 02:32:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:32:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:32:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:32:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366061657] [2024-10-11 02:32:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366061657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:32:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696619914] [2024-10-11 02:32:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:36,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:32:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:36,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:32:36,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:32:36,819 INFO L87 Difference]: Start difference. First operand 569 states and 917 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:40,753 INFO L93 Difference]: Finished difference Result 1281 states and 2091 transitions. [2024-10-11 02:32:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:32:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2024-10-11 02:32:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:40,758 INFO L225 Difference]: With dead ends: 1281 [2024-10-11 02:32:40,758 INFO L226 Difference]: Without dead ends: 780 [2024-10-11 02:32:40,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:32:40,761 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1350 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 4735 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 4735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:40,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 1940 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 4735 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:32:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-11 02:32:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 575. [2024-10-11 02:32:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 446 states have (on average 1.616591928251121) internal successors, (721), 463 states have internal predecessors, (721), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:32:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 922 transitions. [2024-10-11 02:32:40,875 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 922 transitions. Word has length 98 [2024-10-11 02:32:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:40,876 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 922 transitions. [2024-10-11 02:32:40,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:32:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 922 transitions. [2024-10-11 02:32:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:32:40,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:40,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:40,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:32:40,879 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:40,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1863028494, now seen corresponding path program 1 times [2024-10-11 02:32:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568988439] [2024-10-11 02:32:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:32:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:32:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:32:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:32:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:32:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:32:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:41,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:41,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568988439] [2024-10-11 02:32:41,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568988439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:41,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:41,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022907883] [2024-10-11 02:32:41,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:41,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:41,139 INFO L87 Difference]: Start difference. First operand 575 states and 922 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:43,904 INFO L93 Difference]: Finished difference Result 1307 states and 2122 transitions. [2024-10-11 02:32:43,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:43,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 02:32:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:43,910 INFO L225 Difference]: With dead ends: 1307 [2024-10-11 02:32:43,910 INFO L226 Difference]: Without dead ends: 788 [2024-10-11 02:32:43,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:43,913 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1352 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:43,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 1039 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-11 02:32:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 575. [2024-10-11 02:32:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 446 states have (on average 1.6053811659192825) internal successors, (716), 463 states have internal predecessors, (716), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:32:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 917 transitions. [2024-10-11 02:32:44,011 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 917 transitions. Word has length 98 [2024-10-11 02:32:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:44,012 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 917 transitions. [2024-10-11 02:32:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 917 transitions. [2024-10-11 02:32:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:32:44,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:44,015 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:32:44,015 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1072937855, now seen corresponding path program 1 times [2024-10-11 02:32:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242789879] [2024-10-11 02:32:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:32:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:32:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:32:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:32:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:44,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242789879] [2024-10-11 02:32:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242789879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:44,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50083585] [2024-10-11 02:32:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:44,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:44,318 INFO L87 Difference]: Start difference. First operand 575 states and 917 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:47,333 INFO L93 Difference]: Finished difference Result 1292 states and 2094 transitions. [2024-10-11 02:32:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:32:47,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-11 02:32:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:47,338 INFO L225 Difference]: With dead ends: 1292 [2024-10-11 02:32:47,338 INFO L226 Difference]: Without dead ends: 788 [2024-10-11 02:32:47,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:32:47,340 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1336 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:47,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1039 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-11 02:32:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 583. [2024-10-11 02:32:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 454 states have (on average 1.592511013215859) internal successors, (723), 471 states have internal predecessors, (723), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:32:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 924 transitions. [2024-10-11 02:32:47,454 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 924 transitions. Word has length 99 [2024-10-11 02:32:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:47,454 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 924 transitions. [2024-10-11 02:32:47,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 924 transitions. [2024-10-11 02:32:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:32:47,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:47,457 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:47,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:32:47,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1984578975, now seen corresponding path program 1 times [2024-10-11 02:32:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040432703] [2024-10-11 02:32:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:32:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:32:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:32:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:32:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:32:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:32:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:47,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040432703] [2024-10-11 02:32:47,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040432703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:47,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:47,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:47,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823420861] [2024-10-11 02:32:47,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:47,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:47,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:47,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:47,732 INFO L87 Difference]: Start difference. First operand 583 states and 924 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:50,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:50,775 INFO L93 Difference]: Finished difference Result 1351 states and 2162 transitions. [2024-10-11 02:32:50,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:32:50,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-11 02:32:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:50,781 INFO L225 Difference]: With dead ends: 1351 [2024-10-11 02:32:50,781 INFO L226 Difference]: Without dead ends: 762 [2024-10-11 02:32:50,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:32:50,784 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1298 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:50,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1029 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-10-11 02:32:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 565. [2024-10-11 02:32:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 439 states have (on average 1.5968109339407746) internal successors, (701), 454 states have internal predecessors, (701), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 898 transitions. [2024-10-11 02:32:50,916 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 898 transitions. Word has length 99 [2024-10-11 02:32:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 898 transitions. [2024-10-11 02:32:50,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 898 transitions. [2024-10-11 02:32:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:32:50,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:50,920 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:50,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:32:50,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:50,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1266408427, now seen corresponding path program 1 times [2024-10-11 02:32:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179085330] [2024-10-11 02:32:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:32:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:32:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:32:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:32:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:32:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:32:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179085330] [2024-10-11 02:32:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179085330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:51,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282274658] [2024-10-11 02:32:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:51,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:51,218 INFO L87 Difference]: Start difference. First operand 565 states and 898 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:54,032 INFO L93 Difference]: Finished difference Result 1283 states and 2069 transitions. [2024-10-11 02:32:54,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:32:54,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-11 02:32:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:54,039 INFO L225 Difference]: With dead ends: 1283 [2024-10-11 02:32:54,039 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 02:32:54,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:32:54,042 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1313 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:54,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1044 Invalid, 2783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 02:32:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 02:32:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 575. [2024-10-11 02:32:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.5835189309576838) internal successors, (711), 464 states have internal predecessors, (711), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 908 transitions. [2024-10-11 02:32:54,158 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 908 transitions. Word has length 100 [2024-10-11 02:32:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:54,158 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 908 transitions. [2024-10-11 02:32:54,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 908 transitions. [2024-10-11 02:32:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:32:54,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:54,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:32:54,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash 475760524, now seen corresponding path program 1 times [2024-10-11 02:32:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101465142] [2024-10-11 02:32:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:32:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:32:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:32:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:32:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:32:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101465142] [2024-10-11 02:32:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101465142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:32:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:32:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661473857] [2024-10-11 02:32:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:54,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:32:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:32:54,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:32:54,429 INFO L87 Difference]: Start difference. First operand 575 states and 908 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:57,611 INFO L93 Difference]: Finished difference Result 1300 states and 2081 transitions. [2024-10-11 02:32:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:32:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-10-11 02:32:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:57,617 INFO L225 Difference]: With dead ends: 1300 [2024-10-11 02:32:57,617 INFO L226 Difference]: Without dead ends: 769 [2024-10-11 02:32:57,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:32:57,620 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1352 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:57,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 1032 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 02:32:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-10-11 02:32:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 575. [2024-10-11 02:32:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.5746102449888641) internal successors, (707), 464 states have internal predecessors, (707), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:32:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 904 transitions. [2024-10-11 02:32:57,749 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 904 transitions. Word has length 101 [2024-10-11 02:32:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:57,750 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 904 transitions. [2024-10-11 02:32:57,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:32:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 904 transitions. [2024-10-11 02:32:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:32:57,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:57,753 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:57,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:32:57,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:57,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 448694922, now seen corresponding path program 1 times [2024-10-11 02:32:57,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:57,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88433004] [2024-10-11 02:32:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:57,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:57,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:32:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:32:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:32:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:32:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:32:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:32:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88433004] [2024-10-11 02:32:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88433004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641687939] [2024-10-11 02:32:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:58,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:58,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:58,052 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:58,053 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:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:58,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:58,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:32:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:32:58,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:32:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641687939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:32:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:32:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:32:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858483340] [2024-10-11 02:32:58,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:32:58,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:32:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:32:58,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:32:58,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:32:58,458 INFO L87 Difference]: Start difference. First operand 575 states and 904 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:32:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:32:59,123 INFO L93 Difference]: Finished difference Result 1088 states and 1763 transitions. [2024-10-11 02:32:59,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:32:59,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-10-11 02:32:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:32:59,127 INFO L225 Difference]: With dead ends: 1088 [2024-10-11 02:32:59,128 INFO L226 Difference]: Without dead ends: 583 [2024-10-11 02:32:59,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:32:59,131 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 821 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:32:59,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2065 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 02:32:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-11 02:32:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-10-11 02:32:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 456 states have (on average 1.5767543859649122) internal successors, (719), 471 states have internal predecessors, (719), 99 states have call successors, (99), 28 states have call predecessors, (99), 27 states have return successors, (99), 96 states have call predecessors, (99), 98 states have call successors, (99) [2024-10-11 02:32:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 917 transitions. [2024-10-11 02:32:59,239 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 917 transitions. Word has length 101 [2024-10-11 02:32:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:32:59,239 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 917 transitions. [2024-10-11 02:32:59,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:32:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 917 transitions. [2024-10-11 02:32:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:32:59,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:32:59,242 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:32:59,263 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:59,443 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:59,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:32:59,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:32:59,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1837575412, now seen corresponding path program 1 times [2024-10-11 02:32:59,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:32:59,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115550676] [2024-10-11 02:32:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:32:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:32:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:32:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:32:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:32:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:32:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:32:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:32:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:32:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:32:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:32:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 02:32:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:32:59,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115550676] [2024-10-11 02:32:59,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115550676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:32:59,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079642064] [2024-10-11 02:32:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:32:59,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:32:59,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:32:59,728 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:59,729 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:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:32:59,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:32:59,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:33:00,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079642064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:33:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905668317] [2024-10-11 02:33:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:00,072 INFO L87 Difference]: Start difference. First operand 583 states and 917 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:00,582 INFO L93 Difference]: Finished difference Result 1104 states and 1786 transitions. [2024-10-11 02:33:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:33:00,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-11 02:33:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:00,586 INFO L225 Difference]: With dead ends: 1104 [2024-10-11 02:33:00,587 INFO L226 Difference]: Without dead ends: 591 [2024-10-11 02:33:00,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:33:00,590 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 815 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:00,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2062 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:33:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-11 02:33:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2024-10-11 02:33:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 463 states have (on average 1.5788336933045357) internal successors, (731), 478 states have internal predecessors, (731), 99 states have call successors, (99), 29 states have call predecessors, (99), 28 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-10-11 02:33:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 930 transitions. [2024-10-11 02:33:00,714 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 930 transitions. Word has length 104 [2024-10-11 02:33:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:00,714 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 930 transitions. [2024-10-11 02:33:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 930 transitions. [2024-10-11 02:33:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:33:00,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:00,717 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:33:00,736 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:33:00,917 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:33:00,918 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:00,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1284678714, now seen corresponding path program 1 times [2024-10-11 02:33:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:00,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177094167] [2024-10-11 02:33:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:00,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:33:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:33:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:33:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:33:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:33:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:33:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:33:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177094167] [2024-10-11 02:33:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177094167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102559400] [2024-10-11 02:33:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:01,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:01,209 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:33:01,210 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:33:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:01,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:33:01,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:33:01,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102559400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:01,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:33:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818139729] [2024-10-11 02:33:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:01,550 INFO L87 Difference]: Start difference. First operand 591 states and 930 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:02,048 INFO L93 Difference]: Finished difference Result 1120 states and 1809 transitions. [2024-10-11 02:33:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:33:02,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-10-11 02:33:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:02,052 INFO L225 Difference]: With dead ends: 1120 [2024-10-11 02:33:02,053 INFO L226 Difference]: Without dead ends: 599 [2024-10-11 02:33:02,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:33:02,055 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 796 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:02,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2059 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:33:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-10-11 02:33:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2024-10-11 02:33:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 470 states have (on average 1.5808510638297872) internal successors, (743), 485 states have internal predecessors, (743), 99 states have call successors, (99), 30 states have call predecessors, (99), 29 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2024-10-11 02:33:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 943 transitions. [2024-10-11 02:33:02,188 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 943 transitions. Word has length 107 [2024-10-11 02:33:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:02,188 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 943 transitions. [2024-10-11 02:33:02,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 943 transitions. [2024-10-11 02:33:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:33:02,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:02,191 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:33:02,212 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:33:02,391 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:33:02,392 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:02,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 303327912, now seen corresponding path program 1 times [2024-10-11 02:33:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:02,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75269321] [2024-10-11 02:33:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:33:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:33:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:33:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:33:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:33:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:33:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 02:33:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75269321] [2024-10-11 02:33:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75269321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134817510] [2024-10-11 02:33:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:02,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:02,700 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:33:02,701 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:33:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:02,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:33:02,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 02:33:03,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:03,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134817510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:03,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 02:33:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612082111] [2024-10-11 02:33:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:03,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:33:03,039 INFO L87 Difference]: Start difference. First operand 599 states and 943 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:03,623 INFO L93 Difference]: Finished difference Result 1136 states and 1832 transitions. [2024-10-11 02:33:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:33:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-10-11 02:33:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:03,627 INFO L225 Difference]: With dead ends: 1136 [2024-10-11 02:33:03,627 INFO L226 Difference]: Without dead ends: 607 [2024-10-11 02:33:03,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:33:03,630 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 802 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:03,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 2056 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:33:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-11 02:33:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2024-10-11 02:33:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 477 states have (on average 1.5828092243186582) internal successors, (755), 492 states have internal predecessors, (755), 99 states have call successors, (99), 31 states have call predecessors, (99), 30 states have return successors, (102), 96 states have call predecessors, (102), 98 states have call successors, (102) [2024-10-11 02:33:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 956 transitions. [2024-10-11 02:33:03,740 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 956 transitions. Word has length 110 [2024-10-11 02:33:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:33:03,740 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 956 transitions. [2024-10-11 02:33:03,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 956 transitions. [2024-10-11 02:33:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:33:03,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:33:03,744 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:33:03,764 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:33:03,944 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:33:03,945 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:33:03,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:33:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -841519358, now seen corresponding path program 1 times [2024-10-11 02:33:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:33:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566445922] [2024-10-11 02:33:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:33:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:33:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:33:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:33:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:33:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:33:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:33:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:33:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:33:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:33:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:33:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:33:04,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:33:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566445922] [2024-10-11 02:33:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566445922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:33:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658859947] [2024-10-11 02:33:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:33:04,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:33:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:33:04,507 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:33:04,508 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:33:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:33:04,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 02:33:04,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:33:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:33:04,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:33:04,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658859947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:33:04,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:33:04,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:33:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058351397] [2024-10-11 02:33:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:33:04,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:33:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:33:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:33:04,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:33:04,908 INFO L87 Difference]: Start difference. First operand 607 states and 956 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:33:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:33:05,563 INFO L93 Difference]: Finished difference Result 1687 states and 2746 transitions. [2024-10-11 02:33:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:33:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-10-11 02:33:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:33:05,570 INFO L225 Difference]: With dead ends: 1687 [2024-10-11 02:33:05,571 INFO L226 Difference]: Without dead ends: 1150 [2024-10-11 02:33:05,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:33:05,574 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 786 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:33:05,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 3146 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:33:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states.