./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_spec2_product24.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_spec2_product24.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 e942074e046d4b6eec963a95d600daf33500a37aba1da700aae37a309fea4cda --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:35:33,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:35:33,908 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:35:33,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:35:33,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:35:33,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:35:33,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:35:33,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:35:33,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:35:33,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:35:33,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:35:33,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:35:33,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:35:33,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:35:33,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:35:33,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:35:33,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:35:33,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:35:33,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:35:33,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:35:33,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:35:33,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:35:33,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:35:33,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:35:33,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:35:33,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:35:33,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:35:33,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:35:33,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:35:33,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:35:33,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:35:33,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:35:33,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:33,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:35:33,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:35:33,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:35:33,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:35:33,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:35:33,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:35:33,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:35:33,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:35:33,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:35:33,960 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 -> e942074e046d4b6eec963a95d600daf33500a37aba1da700aae37a309fea4cda [2024-10-11 02:35:34,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:35:34,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:35:34,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:35:34,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:35:34,234 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:35:34,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2024-10-11 02:35:35,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:35:35,986 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:35:35,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2024-10-11 02:35:36,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/919b39dff/a9816b47eab7474d906b79d9e74b03b5/FLAGdf4f53243 [2024-10-11 02:35:36,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/919b39dff/a9816b47eab7474d906b79d9e74b03b5 [2024-10-11 02:35:36,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:35:36,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:35:36,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:36,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:35:36,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:35:36,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:36" (1/1) ... [2024-10-11 02:35:36,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5017c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:36, skipping insertion in model container [2024-10-11 02:35:36,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:35:36" (1/1) ... [2024-10-11 02:35:36,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:35:36,867 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_spec2_product24.cil.c[63703,63716] [2024-10-11 02:35:36,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:36,975 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:35:36,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-11 02:35:36,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [716] [2024-10-11 02:35:36,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2374] [2024-10-11 02:35:36,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2556] [2024-10-11 02:35:36,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2912] [2024-10-11 02:35:36,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3030] [2024-10-11 02:35:36,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3042] [2024-10-11 02:35:36,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3077] [2024-10-11 02:35:36,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3086] [2024-10-11 02:35:36,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3177] [2024-10-11 02:35:37,063 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_spec2_product24.cil.c[63703,63716] [2024-10-11 02:35:37,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:35:37,103 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:35:37,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37 WrapperNode [2024-10-11 02:35:37,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:35:37,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:37,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:35:37,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:35:37,110 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:35:37" (1/1) ... [2024-10-11 02:35:37,133 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:35:37" (1/1) ... [2024-10-11 02:35:37,181 INFO L138 Inliner]: procedures = 98, calls = 353, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 936 [2024-10-11 02:35:37,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:35:37,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:35:37,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:35:37,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:35:37,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,237 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 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:35:37,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:35:37,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:35:37,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:35:37,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:35:37,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (1/1) ... [2024-10-11 02:35:37,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:35:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:35:37,375 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:35:37,377 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:35:37,428 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:35:37,429 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:35:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:35:37,429 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:35:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:35:37,429 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:35:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:35:37,429 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:35:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:35:37,430 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:35:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:35:37,431 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:35:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:35:37,431 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:35:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:35:37,432 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:35:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:35:37,432 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:35:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:35:37,432 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:35:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:35:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:35:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:35:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:35:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:35:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:35:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:35:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:35:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:35:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:35:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:35:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:35:37,435 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:35:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:35:37,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:35:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:35:37,435 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:35:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:35:37,435 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:35:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:35:37,436 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:35:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:35:37,436 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:35:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:35:37,436 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:35:37,436 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:35:37,436 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:35:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:35:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:35:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:35:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:35:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:35:37,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:35:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:35:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:35:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:35:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:35:37,439 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:35:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:35:37,441 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:35:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:35:37,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:35:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:35:37,441 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:35:37,441 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-11 02:35:37,442 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-11 02:35:37,647 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:35:37,649 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:35:38,918 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2024-10-11 02:35:38,918 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:35:39,003 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:35:39,003 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:35:39,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:39 BoogieIcfgContainer [2024-10-11 02:35:39,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:35:39,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:35:39,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:35:39,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:35:39,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:35:36" (1/3) ... [2024-10-11 02:35:39,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb27fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:39, skipping insertion in model container [2024-10-11 02:35:39,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:35:37" (2/3) ... [2024-10-11 02:35:39,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb27fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:35:39, skipping insertion in model container [2024-10-11 02:35:39,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:35:39" (3/3) ... [2024-10-11 02:35:39,011 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2024-10-11 02:35:39,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:35:39,028 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:35:39,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:35:39,127 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;@627bfff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:35:39,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:35:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 574 states, 440 states have (on average 1.709090909090909) internal successors, (752), 463 states have internal predecessors, (752), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 02:35:39,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 02:35:39,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:39,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:39,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:39,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash -413035975, now seen corresponding path program 1 times [2024-10-11 02:35:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982590543] [2024-10-11 02:35:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:35:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:35:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:40,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982590543] [2024-10-11 02:35:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982590543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359593458] [2024-10-11 02:35:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:40,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:40,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:40,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:40,405 INFO L87 Difference]: Start difference. First operand has 574 states, 440 states have (on average 1.709090909090909) internal successors, (752), 463 states have internal predecessors, (752), 105 states have call successors, (105), 27 states have call predecessors, (105), 27 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:35:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:45,533 INFO L93 Difference]: Finished difference Result 1293 states and 2195 transitions. [2024-10-11 02:35:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-10-11 02:35:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:45,557 INFO L225 Difference]: With dead ends: 1293 [2024-10-11 02:35:45,558 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 02:35:45,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:35:45,573 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1177 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:45,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1083 Invalid, 2998 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [279 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:35:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 02:35:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-11 02:35:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6986301369863013) internal successors, (744), 459 states have internal predecessors, (744), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 02:35:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 949 transitions. [2024-10-11 02:35:45,784 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 949 transitions. Word has length 50 [2024-10-11 02:35:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 949 transitions. [2024-10-11 02:35:45,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:35:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 949 transitions. [2024-10-11 02:35:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:35:45,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:45,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:45,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:35:45,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:45,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1791506687, now seen corresponding path program 1 times [2024-10-11 02:35:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:45,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093581030] [2024-10-11 02:35:45,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:35:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093581030] [2024-10-11 02:35:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093581030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327639463] [2024-10-11 02:35:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:46,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:46,481 INFO L87 Difference]: Start difference. First operand 570 states and 949 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:35:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:51,107 INFO L93 Difference]: Finished difference Result 1286 states and 2168 transitions. [2024-10-11 02:35:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-10-11 02:35:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:51,114 INFO L225 Difference]: With dead ends: 1286 [2024-10-11 02:35:51,115 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 02:35:51,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:35:51,119 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 705 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:51,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1086 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:35:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 02:35:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-11 02:35:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6963470319634704) internal successors, (743), 459 states have internal predecessors, (743), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 02:35:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 948 transitions. [2024-10-11 02:35:51,222 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 948 transitions. Word has length 52 [2024-10-11 02:35:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:51,223 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 948 transitions. [2024-10-11 02:35:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:35:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 948 transitions. [2024-10-11 02:35:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 02:35:51,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:51,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:35:51,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:51,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1111838289, now seen corresponding path program 1 times [2024-10-11 02:35:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040728342] [2024-10-11 02:35:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:35:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:35:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040728342] [2024-10-11 02:35:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040728342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:51,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:51,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833426771] [2024-10-11 02:35:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:51,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:51,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:51,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:51,835 INFO L87 Difference]: Start difference. First operand 570 states and 948 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:35:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:35:55,990 INFO L93 Difference]: Finished difference Result 1286 states and 2167 transitions. [2024-10-11 02:35:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:35:55,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-11 02:35:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:35:55,997 INFO L225 Difference]: With dead ends: 1286 [2024-10-11 02:35:55,997 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 02:35:56,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:35:56,002 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 704 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:35:56,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1077 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 02:35:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 02:35:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-11 02:35:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6940639269406392) internal successors, (742), 459 states have internal predecessors, (742), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 02:35:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 947 transitions. [2024-10-11 02:35:56,123 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 947 transitions. Word has length 53 [2024-10-11 02:35:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:35:56,123 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 947 transitions. [2024-10-11 02:35:56,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:35:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 947 transitions. [2024-10-11 02:35:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:35:56,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:35:56,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:35:56,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:35:56,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:35:56,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:35:56,127 INFO L85 PathProgramCache]: Analyzing trace with hash 270018245, now seen corresponding path program 1 times [2024-10-11 02:35:56,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:35:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127573928] [2024-10-11 02:35:56,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:35:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:35:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:35:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:35:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:35:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:35:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:35:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:35:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:35:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:35:56,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127573928] [2024-10-11 02:35:56,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127573928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:35:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:35:56,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:35:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350511815] [2024-10-11 02:35:56,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:35:56,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:35:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:35:56,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:35:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:35:56,718 INFO L87 Difference]: Start difference. First operand 570 states and 947 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:00,686 INFO L93 Difference]: Finished difference Result 1286 states and 2166 transitions. [2024-10-11 02:36:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:00,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-11 02:36:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:00,692 INFO L225 Difference]: With dead ends: 1286 [2024-10-11 02:36:00,692 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 02:36:00,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:00,696 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1165 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:00,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1090 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:36:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 02:36:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-11 02:36:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6917808219178083) internal successors, (741), 459 states have internal predecessors, (741), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 02:36:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 946 transitions. [2024-10-11 02:36:00,811 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 946 transitions. Word has length 54 [2024-10-11 02:36:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:00,811 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 946 transitions. [2024-10-11 02:36:00,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 946 transitions. [2024-10-11 02:36:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:36:00,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:00,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:00,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:36:00,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1944870515, now seen corresponding path program 1 times [2024-10-11 02:36:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:00,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925161874] [2024-10-11 02:36:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:36:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:36:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:01,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:01,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925161874] [2024-10-11 02:36:01,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925161874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:01,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:01,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:01,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708402569] [2024-10-11 02:36:01,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:01,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:01,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:01,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:01,330 INFO L87 Difference]: Start difference. First operand 570 states and 946 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:05,448 INFO L93 Difference]: Finished difference Result 1286 states and 2165 transitions. [2024-10-11 02:36:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2024-10-11 02:36:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:05,454 INFO L225 Difference]: With dead ends: 1286 [2024-10-11 02:36:05,454 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 02:36:05,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:05,458 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 700 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:05,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1077 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:36:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 02:36:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 570. [2024-10-11 02:36:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 438 states have (on average 1.6894977168949772) internal successors, (740), 459 states have internal predecessors, (740), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 02:36:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 945 transitions. [2024-10-11 02:36:05,554 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 945 transitions. Word has length 55 [2024-10-11 02:36:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:05,554 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 945 transitions. [2024-10-11 02:36:05,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 945 transitions. [2024-10-11 02:36:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:36:05,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:05,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:05,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:36:05,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -182311287, now seen corresponding path program 1 times [2024-10-11 02:36:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70696306] [2024-10-11 02:36:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:36:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70696306] [2024-10-11 02:36:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70696306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:06,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644049826] [2024-10-11 02:36:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:06,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:06,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:06,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:06,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:06,219 INFO L87 Difference]: Start difference. First operand 570 states and 945 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:36:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:11,765 INFO L93 Difference]: Finished difference Result 1262 states and 2114 transitions. [2024-10-11 02:36:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:36:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2024-10-11 02:36:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:11,770 INFO L225 Difference]: With dead ends: 1262 [2024-10-11 02:36:11,770 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 02:36:11,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:36:11,774 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1256 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 5044 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 5328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 5044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:11,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1958 Invalid, 5328 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [284 Valid, 5044 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:36:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 02:36:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 582. [2024-10-11 02:36:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.686800894854586) internal successors, (754), 470 states have internal predecessors, (754), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 963 transitions. [2024-10-11 02:36:11,880 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 963 transitions. Word has length 56 [2024-10-11 02:36:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:11,880 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 963 transitions. [2024-10-11 02:36:11,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:36:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 963 transitions. [2024-10-11 02:36:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:36:11,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:11,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:11,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:36:11,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:11,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1883051766, now seen corresponding path program 1 times [2024-10-11 02:36:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:11,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373161181] [2024-10-11 02:36:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:36:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373161181] [2024-10-11 02:36:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373161181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102194673] [2024-10-11 02:36:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:12,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:12,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:12,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:12,429 INFO L87 Difference]: Start difference. First operand 582 states and 963 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:16,049 INFO L93 Difference]: Finished difference Result 1284 states and 2152 transitions. [2024-10-11 02:36:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2024-10-11 02:36:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:16,054 INFO L225 Difference]: With dead ends: 1284 [2024-10-11 02:36:16,054 INFO L226 Difference]: Without dead ends: 758 [2024-10-11 02:36:16,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:16,057 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1231 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:16,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1069 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:36:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-11 02:36:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-11 02:36:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.6756152125279642) internal successors, (749), 470 states have internal predecessors, (749), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 958 transitions. [2024-10-11 02:36:16,157 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 958 transitions. Word has length 56 [2024-10-11 02:36:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:16,157 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 958 transitions. [2024-10-11 02:36:16,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 958 transitions. [2024-10-11 02:36:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:36:16,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:16,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:16,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:36:16,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:16,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -320933887, now seen corresponding path program 1 times [2024-10-11 02:36:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:16,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431723410] [2024-10-11 02:36:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:36:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:16,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:16,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431723410] [2024-10-11 02:36:16,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431723410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:16,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:16,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:16,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290081660] [2024-10-11 02:36:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:16,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:16,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:16,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:16,718 INFO L87 Difference]: Start difference. First operand 582 states and 958 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:20,064 INFO L93 Difference]: Finished difference Result 1284 states and 2147 transitions. [2024-10-11 02:36:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-11 02:36:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:20,071 INFO L225 Difference]: With dead ends: 1284 [2024-10-11 02:36:20,071 INFO L226 Difference]: Without dead ends: 758 [2024-10-11 02:36:20,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:20,074 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1225 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:20,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1090 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-11 02:36:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-11 02:36:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.6644295302013423) internal successors, (744), 470 states have internal predecessors, (744), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 953 transitions. [2024-10-11 02:36:20,181 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 953 transitions. Word has length 57 [2024-10-11 02:36:20,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:20,182 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 953 transitions. [2024-10-11 02:36:20,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 953 transitions. [2024-10-11 02:36:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:36:20,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:20,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:36:20,183 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:20,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash 434165509, now seen corresponding path program 1 times [2024-10-11 02:36:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:20,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950941320] [2024-10-11 02:36:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:20,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:36:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950941320] [2024-10-11 02:36:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950941320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:20,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:20,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258976837] [2024-10-11 02:36:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:20,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:20,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:20,675 INFO L87 Difference]: Start difference. First operand 582 states and 953 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:24,293 INFO L93 Difference]: Finished difference Result 1284 states and 2142 transitions. [2024-10-11 02:36:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:24,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 02:36:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:24,298 INFO L225 Difference]: With dead ends: 1284 [2024-10-11 02:36:24,298 INFO L226 Difference]: Without dead ends: 758 [2024-10-11 02:36:24,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:24,300 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 757 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2769 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:24,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1077 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2769 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:36:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-11 02:36:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-11 02:36:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.6532438478747205) internal successors, (739), 470 states have internal predecessors, (739), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 948 transitions. [2024-10-11 02:36:24,402 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 948 transitions. Word has length 58 [2024-10-11 02:36:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:24,402 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 948 transitions. [2024-10-11 02:36:24,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 948 transitions. [2024-10-11 02:36:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:36:24,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:24,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:24,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:36:24,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:24,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash 183120508, now seen corresponding path program 1 times [2024-10-11 02:36:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395110230] [2024-10-11 02:36:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395110230] [2024-10-11 02:36:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395110230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:24,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:24,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786713839] [2024-10-11 02:36:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:24,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:24,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:24,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:24,964 INFO L87 Difference]: Start difference. First operand 582 states and 948 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:36:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:30,100 INFO L93 Difference]: Finished difference Result 1264 states and 2100 transitions. [2024-10-11 02:36:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:36:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-11 02:36:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:30,105 INFO L225 Difference]: With dead ends: 1264 [2024-10-11 02:36:30,105 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 02:36:30,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:30,108 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 746 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 5075 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 5204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 5075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:30,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1870 Invalid, 5204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 5075 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:36:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 02:36:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 582. [2024-10-11 02:36:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.651006711409396) internal successors, (738), 470 states have internal predecessors, (738), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 947 transitions. [2024-10-11 02:36:30,212 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 947 transitions. Word has length 59 [2024-10-11 02:36:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:30,212 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 947 transitions. [2024-10-11 02:36:30,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:36:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 947 transitions. [2024-10-11 02:36:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:36:30,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:30,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:30,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:36:30,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1941495708, now seen corresponding path program 1 times [2024-10-11 02:36:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351091756] [2024-10-11 02:36:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:36:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:30,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:30,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351091756] [2024-10-11 02:36:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351091756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:30,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418635197] [2024-10-11 02:36:30,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:30,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:30,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:30,721 INFO L87 Difference]: Start difference. First operand 582 states and 947 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:34,130 INFO L93 Difference]: Finished difference Result 1284 states and 2133 transitions. [2024-10-11 02:36:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-11 02:36:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:34,136 INFO L225 Difference]: With dead ends: 1284 [2024-10-11 02:36:34,136 INFO L226 Difference]: Without dead ends: 758 [2024-10-11 02:36:34,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:34,139 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1224 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:34,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1074 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2602 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:36:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-11 02:36:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2024-10-11 02:36:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 447 states have (on average 1.639821029082774) internal successors, (733), 470 states have internal predecessors, (733), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 942 transitions. [2024-10-11 02:36:34,242 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 942 transitions. Word has length 59 [2024-10-11 02:36:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:34,242 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 942 transitions. [2024-10-11 02:36:34,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 942 transitions. [2024-10-11 02:36:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:36:34,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:34,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:34,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:36:34,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:34,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -296697886, now seen corresponding path program 1 times [2024-10-11 02:36:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:34,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590468027] [2024-10-11 02:36:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:34,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:34,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590468027] [2024-10-11 02:36:34,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590468027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:34,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:34,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384189777] [2024-10-11 02:36:34,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:34,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:34,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:34,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:34,818 INFO L87 Difference]: Start difference. First operand 582 states and 942 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:36:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:39,742 INFO L93 Difference]: Finished difference Result 1272 states and 2103 transitions. [2024-10-11 02:36:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:36:39,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2024-10-11 02:36:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:39,747 INFO L225 Difference]: With dead ends: 1272 [2024-10-11 02:36:39,747 INFO L226 Difference]: Without dead ends: 758 [2024-10-11 02:36:39,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:36:39,750 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1212 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 4882 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 5166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 4882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:39,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1916 Invalid, 5166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 4882 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:36:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-11 02:36:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 585. [2024-10-11 02:36:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 450 states have (on average 1.6333333333333333) internal successors, (735), 473 states have internal predecessors, (735), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 944 transitions. [2024-10-11 02:36:39,852 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 944 transitions. Word has length 60 [2024-10-11 02:36:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:39,852 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 944 transitions. [2024-10-11 02:36:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:36:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 944 transitions. [2024-10-11 02:36:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:36:39,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:39,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:39,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:36:39,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash 998177024, now seen corresponding path program 1 times [2024-10-11 02:36:39,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:39,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630605112] [2024-10-11 02:36:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:36:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:40,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630605112] [2024-10-11 02:36:40,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630605112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:40,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:40,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:40,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70168690] [2024-10-11 02:36:40,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:40,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:40,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:40,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:40,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:40,367 INFO L87 Difference]: Start difference. First operand 585 states and 944 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:43,713 INFO L93 Difference]: Finished difference Result 1293 states and 2133 transitions. [2024-10-11 02:36:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:36:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-11 02:36:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:43,719 INFO L225 Difference]: With dead ends: 1293 [2024-10-11 02:36:43,719 INFO L226 Difference]: Without dead ends: 764 [2024-10-11 02:36:43,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:43,721 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1225 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:43,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1060 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-10-11 02:36:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 585. [2024-10-11 02:36:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 450 states have (on average 1.6222222222222222) internal successors, (730), 473 states have internal predecessors, (730), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 939 transitions. [2024-10-11 02:36:43,825 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 939 transitions. Word has length 60 [2024-10-11 02:36:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:43,826 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 939 transitions. [2024-10-11 02:36:43,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 939 transitions. [2024-10-11 02:36:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:36:43,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:43,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:43,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:36:43,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:43,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1124599529, now seen corresponding path program 1 times [2024-10-11 02:36:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:43,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889382897] [2024-10-11 02:36:43,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889382897] [2024-10-11 02:36:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889382897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158623410] [2024-10-11 02:36:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:44,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:44,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:44,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:44,376 INFO L87 Difference]: Start difference. First operand 585 states and 939 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:48,057 INFO L93 Difference]: Finished difference Result 1276 states and 2100 transitions. [2024-10-11 02:36:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:36:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-11 02:36:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:48,063 INFO L225 Difference]: With dead ends: 1276 [2024-10-11 02:36:48,063 INFO L226 Difference]: Without dead ends: 762 [2024-10-11 02:36:48,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:48,065 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 734 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:48,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1028 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:36:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-10-11 02:36:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 589. [2024-10-11 02:36:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.6145374449339207) internal successors, (733), 477 states have internal predecessors, (733), 106 states have call successors, (106), 27 states have call predecessors, (106), 28 states have return successors, (103), 98 states have call predecessors, (103), 101 states have call successors, (103) [2024-10-11 02:36:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2024-10-11 02:36:48,168 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 61 [2024-10-11 02:36:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:48,168 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2024-10-11 02:36:48,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2024-10-11 02:36:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:36:48,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:48,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:48,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:36:48,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:48,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1394154295, now seen corresponding path program 1 times [2024-10-11 02:36:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:48,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514486847] [2024-10-11 02:36:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:36:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:48,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:48,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514486847] [2024-10-11 02:36:48,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514486847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:48,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:36:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553818265] [2024-10-11 02:36:48,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:48,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:36:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:48,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:36:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:36:48,653 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:52,138 INFO L93 Difference]: Finished difference Result 1331 states and 2163 transitions. [2024-10-11 02:36:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:36:52,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-11 02:36:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:52,142 INFO L225 Difference]: With dead ends: 1331 [2024-10-11 02:36:52,142 INFO L226 Difference]: Without dead ends: 736 [2024-10-11 02:36:52,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:52,144 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1157 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:52,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1066 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-11 02:36:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 571. [2024-10-11 02:36:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 439 states have (on average 1.6218678815489749) internal successors, (712), 460 states have internal predecessors, (712), 105 states have call successors, (105), 27 states have call predecessors, (105), 26 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 02:36:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 917 transitions. [2024-10-11 02:36:52,240 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 917 transitions. Word has length 61 [2024-10-11 02:36:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 917 transitions. [2024-10-11 02:36:52,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:36:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 917 transitions. [2024-10-11 02:36:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 02:36:52,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:52,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:36:52,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:36:52,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:52,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 141819997, now seen corresponding path program 1 times [2024-10-11 02:36:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630440275] [2024-10-11 02:36:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:36:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:36:52,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:52,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630440275] [2024-10-11 02:36:52,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630440275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:52,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:52,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:36:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821877594] [2024-10-11 02:36:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:52,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:36:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:36:52,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:36:52,811 INFO L87 Difference]: Start difference. First operand 571 states and 917 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)