./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e942074e046d4b6eec963a95d600daf33500a37aba1da700aae37a309fea4cda --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:51:18,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:51:18,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:51:18,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:51:18,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:51:18,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:51:18,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:51:18,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:51:18,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:51:18,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:51:18,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:51:18,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:51:18,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:51:18,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:51:18,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:51:18,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:51:18,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:51:18,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:51:18,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:51:18,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:51:18,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:51:18,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:51:18,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:51:18,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:51:18,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:51:18,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:51:18,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:51:18,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:51:18,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:51:18,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:51:18,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:51:18,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:51:18,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:51:18,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:51:18,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:51:18,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:51:18,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:51:18,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:51:18,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:51:18,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:51:18,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:51:18,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:51:18,912 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e942074e046d4b6eec963a95d600daf33500a37aba1da700aae37a309fea4cda [2024-11-08 14:51:19,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:51:19,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:51:19,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:51:19,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:51:19,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:51:19,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2024-11-08 14:51:20,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:51:20,908 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:51:20,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product24.cil.c [2024-11-08 14:51:20,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9e367cc/3437a75bf0d742eaa498356ca4707aaf/FLAGb6ed7a6fb [2024-11-08 14:51:20,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9e367cc/3437a75bf0d742eaa498356ca4707aaf [2024-11-08 14:51:20,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:51:20,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:51:20,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:51:20,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:51:20,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:51:20,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:51:20" (1/1) ... [2024-11-08 14:51:20,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495a77a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:20, skipping insertion in model container [2024-11-08 14:51:20,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:51:20" (1/1) ... [2024-11-08 14:51:21,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:51:21,628 WARN L250 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-11-08 14:51:21,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:51:21,702 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:51:21,714 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-11-08 14:51:21,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [716] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2374] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2556] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2912] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3030] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3042] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3077] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3086] [2024-11-08 14:51:21,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3177] [2024-11-08 14:51:21,786 WARN L250 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-11-08 14:51:21,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:51:21,842 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:51:21,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21 WrapperNode [2024-11-08 14:51:21,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:51:21,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:51:21,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:51:21,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:51:21,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:21,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:21,934 INFO L138 Inliner]: procedures = 98, calls = 353, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 936 [2024-11-08 14:51:21,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:51:21,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:51:21,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:51:21,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:51:21,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:21,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:21,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:21,987 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-11-08 14:51:21,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:21,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:22,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:22,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:22,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:22,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:22,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:51:22,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:51:22,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:51:22,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:51:22,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (1/1) ... [2024-11-08 14:51:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:51:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:51:22,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:51:22,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:51:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-08 14:51:22,170 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-08 14:51:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-08 14:51:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-08 14:51:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-08 14:51:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-08 14:51:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 14:51:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 14:51:22,172 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-08 14:51:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-08 14:51:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-08 14:51:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-08 14:51:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-08 14:51:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-08 14:51:22,173 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-08 14:51:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-08 14:51:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-08 14:51:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-08 14:51:22,174 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-08 14:51:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-08 14:51:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:51:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-08 14:51:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-08 14:51:22,175 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-08 14:51:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-08 14:51:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-08 14:51:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-08 14:51:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-08 14:51:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-08 14:51:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 14:51:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 14:51:22,177 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-08 14:51:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-08 14:51:22,177 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-08 14:51:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-08 14:51:22,177 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-08 14:51:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-08 14:51:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-08 14:51:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-08 14:51:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-08 14:51:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-08 14:51:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-08 14:51:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-08 14:51:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-08 14:51:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-08 14:51:22,178 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-08 14:51:22,179 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 14:51:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 14:51:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 14:51:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 14:51:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 14:51:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 14:51:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-08 14:51:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-08 14:51:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-08 14:51:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-08 14:51:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-08 14:51:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-08 14:51:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-08 14:51:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-08 14:51:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-08 14:51:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-08 14:51:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-11-08 14:51:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-11-08 14:51:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:51:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:51:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-08 14:51:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-08 14:51:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-11-08 14:51:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-11-08 14:51:22,422 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:51:22,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:51:23,693 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2024-11-08 14:51:23,693 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:51:23,740 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:51:23,740 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:51:23,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:51:23 BoogieIcfgContainer [2024-11-08 14:51:23,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:51:23,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:51:23,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:51:23,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:51:23,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:51:20" (1/3) ... [2024-11-08 14:51:23,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc64eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:51:23, skipping insertion in model container [2024-11-08 14:51:23,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:51:21" (2/3) ... [2024-11-08 14:51:23,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc64eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:51:23, skipping insertion in model container [2024-11-08 14:51:23,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:51:23" (3/3) ... [2024-11-08 14:51:23,751 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2024-11-08 14:51:23,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:51:23,770 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:51:23,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:51:23,877 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;@2584d2fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:51:23,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:51:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 596 states, 462 states have (on average 1.6753246753246753) internal successors, (774), 485 states have internal predecessors, (774), 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-11-08 14:51:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 14:51:23,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:23,904 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-11-08 14:51:23,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 434401416, now seen corresponding path program 1 times [2024-11-08 14:51:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433135099] [2024-11-08 14:51:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:23,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:24,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 14:51:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:25,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:51:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:25,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:51:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:25,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433135099] [2024-11-08 14:51:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433135099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:25,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:25,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:51:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429226683] [2024-11-08 14:51:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:25,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:51:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:25,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:51:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:51:25,227 INFO L87 Difference]: Start difference. First operand has 596 states, 462 states have (on average 1.6753246753246753) internal successors, (774), 485 states have internal predecessors, (774), 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 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-11-08 14:51:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:30,629 INFO L93 Difference]: Finished difference Result 1335 states and 2237 transitions. [2024-11-08 14:51:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:51:30,631 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-11-08 14:51:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:30,659 INFO L225 Difference]: With dead ends: 1335 [2024-11-08 14:51:30,660 INFO L226 Difference]: Without dead ends: 751 [2024-11-08 14:51:30,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:51:30,679 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 1193 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:30,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1191 Invalid, 2980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [278 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-08 14:51:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-08 14:51:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 588. [2024-11-08 14:51:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 456 states have (on average 1.6710526315789473) internal successors, (762), 477 states have internal predecessors, (762), 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-11-08 14:51:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 967 transitions. [2024-11-08 14:51:30,898 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 967 transitions. Word has length 60 [2024-11-08 14:51:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 967 transitions. [2024-11-08 14:51:30,900 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-11-08 14:51:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 967 transitions. [2024-11-08 14:51:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 14:51:30,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:30,905 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, 1] [2024-11-08 14:51:30,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:51:30,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash 254268749, now seen corresponding path program 1 times [2024-11-08 14:51:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114298533] [2024-11-08 14:51:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 14:51:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:51:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114298533] [2024-11-08 14:51:31,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114298533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:31,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:31,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:51:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80309626] [2024-11-08 14:51:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:51:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:51:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:51:31,590 INFO L87 Difference]: Start difference. First operand 588 states and 967 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (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-11-08 14:51:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:36,304 INFO L93 Difference]: Finished difference Result 1321 states and 2203 transitions. [2024-11-08 14:51:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:51:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (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 63 [2024-11-08 14:51:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:36,313 INFO L225 Difference]: With dead ends: 1321 [2024-11-08 14:51:36,313 INFO L226 Difference]: Without dead ends: 751 [2024-11-08 14:51:36,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:51:36,318 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 718 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:36,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1156 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2837 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 14:51:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-08 14:51:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 588. [2024-11-08 14:51:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 456 states have (on average 1.668859649122807) internal successors, (761), 477 states have internal predecessors, (761), 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-11-08 14:51:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 966 transitions. [2024-11-08 14:51:36,443 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 966 transitions. Word has length 63 [2024-11-08 14:51:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:36,444 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 966 transitions. [2024-11-08 14:51:36,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (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-11-08 14:51:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 966 transitions. [2024-11-08 14:51:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 14:51:36,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:36,447 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, 1, 1] [2024-11-08 14:51:36,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:51:36,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:36,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -127128525, now seen corresponding path program 1 times [2024-11-08 14:51:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:36,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342453067] [2024-11-08 14:51:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:36,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 14:51:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:51:37,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:37,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342453067] [2024-11-08 14:51:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342453067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:37,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:51:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382773141] [2024-11-08 14:51:37,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:37,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:51:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:51:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:51:37,059 INFO L87 Difference]: Start difference. First operand 588 states and 966 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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-11-08 14:51:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:41,003 INFO L93 Difference]: Finished difference Result 1321 states and 2202 transitions. [2024-11-08 14:51:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:51:41,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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 64 [2024-11-08 14:51:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:41,010 INFO L225 Difference]: With dead ends: 1321 [2024-11-08 14:51:41,010 INFO L226 Difference]: Without dead ends: 751 [2024-11-08 14:51:41,013 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-11-08 14:51:41,014 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1190 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:41,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1154 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 14:51:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-08 14:51:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 588. [2024-11-08 14:51:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 456 states have (on average 1.6666666666666667) internal successors, (760), 477 states have internal predecessors, (760), 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-11-08 14:51:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 965 transitions. [2024-11-08 14:51:41,121 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 965 transitions. Word has length 64 [2024-11-08 14:51:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:41,121 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 965 transitions. [2024-11-08 14:51:41,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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-11-08 14:51:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 965 transitions. [2024-11-08 14:51:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 14:51:41,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:41,123 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, 1, 1, 1] [2024-11-08 14:51:41,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:51:41,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:41,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash -27702647, now seen corresponding path program 1 times [2024-11-08 14:51:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622626451] [2024-11-08 14:51:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 14:51:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:51:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:51:41,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622626451] [2024-11-08 14:51:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622626451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:41,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:51:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211519814] [2024-11-08 14:51:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:41,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:51:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:51:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:51:41,689 INFO L87 Difference]: Start difference. First operand 588 states and 965 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (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-11-08 14:51:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:45,768 INFO L93 Difference]: Finished difference Result 1321 states and 2201 transitions. [2024-11-08 14:51:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:51:45,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (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 65 [2024-11-08 14:51:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:45,773 INFO L225 Difference]: With dead ends: 1321 [2024-11-08 14:51:45,774 INFO L226 Difference]: Without dead ends: 751 [2024-11-08 14:51:45,776 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-11-08 14:51:45,777 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1187 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:45,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1148 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 14:51:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-08 14:51:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 588. [2024-11-08 14:51:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 456 states have (on average 1.6644736842105263) internal successors, (759), 477 states have internal predecessors, (759), 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-11-08 14:51:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 964 transitions. [2024-11-08 14:51:45,870 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 964 transitions. Word has length 65 [2024-11-08 14:51:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:45,870 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 964 transitions. [2024-11-08 14:51:45,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (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-11-08 14:51:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 964 transitions. [2024-11-08 14:51:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 14:51:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:45,872 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, 1, 1, 1, 1] [2024-11-08 14:51:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:51:45,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2092339055, now seen corresponding path program 1 times [2024-11-08 14:51:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614560294] [2024-11-08 14:51:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:51:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 14:51:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:51:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:46,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614560294] [2024-11-08 14:51:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614560294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:51:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340567697] [2024-11-08 14:51:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:51:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:46,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:51:46,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:51:46,558 INFO L87 Difference]: Start difference. First operand 588 states and 964 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (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-11-08 14:51:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:50,454 INFO L93 Difference]: Finished difference Result 1321 states and 2200 transitions. [2024-11-08 14:51:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:51:50,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (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 66 [2024-11-08 14:51:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:50,459 INFO L225 Difference]: With dead ends: 1321 [2024-11-08 14:51:50,459 INFO L226 Difference]: Without dead ends: 751 [2024-11-08 14:51:50,461 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-11-08 14:51:50,462 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1185 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:50,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1142 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 2692 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 14:51:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-08 14:51:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 588. [2024-11-08 14:51:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 456 states have (on average 1.662280701754386) internal successors, (758), 477 states have internal predecessors, (758), 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-11-08 14:51:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 963 transitions. [2024-11-08 14:51:50,555 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 963 transitions. Word has length 66 [2024-11-08 14:51:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:50,557 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 963 transitions. [2024-11-08 14:51:50,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (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-11-08 14:51:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 963 transitions. [2024-11-08 14:51:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 14:51:50,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:50,559 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, 1, 1, 1, 1, 1] [2024-11-08 14:51:50,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:51:50,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1868005435, now seen corresponding path program 1 times [2024-11-08 14:51:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935930747] [2024-11-08 14:51:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:50,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:51:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:51:51,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935930747] [2024-11-08 14:51:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935930747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 14:51:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488496641] [2024-11-08 14:51:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:51,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:51:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:51:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:51:51,308 INFO L87 Difference]: Start difference. First operand 588 states and 963 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 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-11-08 14:51:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:51:57,257 INFO L93 Difference]: Finished difference Result 1298 states and 2150 transitions. [2024-11-08 14:51:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:51:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 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 67 [2024-11-08 14:51:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:51:57,262 INFO L225 Difference]: With dead ends: 1298 [2024-11-08 14:51:57,262 INFO L226 Difference]: Without dead ends: 777 [2024-11-08 14:51:57,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-08 14:51:57,266 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1273 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 6658 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 6941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 6658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:51:57,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 2716 Invalid, 6941 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [283 Valid, 6658 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 14:51:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-08 14:51:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 601. [2024-11-08 14:51:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 466 states have (on average 1.6587982832618027) internal successors, (773), 489 states have internal predecessors, (773), 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-11-08 14:51:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 982 transitions. [2024-11-08 14:51:57,373 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 982 transitions. Word has length 67 [2024-11-08 14:51:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:51:57,373 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 982 transitions. [2024-11-08 14:51:57,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 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-11-08 14:51:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 982 transitions. [2024-11-08 14:51:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 14:51:57,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:51:57,377 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, 1, 1, 1, 1, 1] [2024-11-08 14:51:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:51:57,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:51:57,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:51:57,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2108545564, now seen corresponding path program 1 times [2024-11-08 14:51:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:51:57,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741489142] [2024-11-08 14:51:57,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:51:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:51:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:51:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:51:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:51:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:51:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:51:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:51:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:51:57,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:51:57,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741489142] [2024-11-08 14:51:57,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741489142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:51:57,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:51:57,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:51:57,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694902978] [2024-11-08 14:51:57,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:51:57,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:51:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:51:57,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:51:57,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:51:57,915 INFO L87 Difference]: Start difference. First operand 601 states and 982 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-11-08 14:52:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:01,519 INFO L93 Difference]: Finished difference Result 1324 states and 2192 transitions. [2024-11-08 14:52:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:52:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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 67 [2024-11-08 14:52:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:01,525 INFO L225 Difference]: With dead ends: 1324 [2024-11-08 14:52:01,525 INFO L226 Difference]: Without dead ends: 785 [2024-11-08 14:52:01,527 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-11-08 14:52:01,530 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1251 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:01,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1154 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 14:52:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-08 14:52:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 601. [2024-11-08 14:52:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 466 states have (on average 1.648068669527897) internal successors, (768), 489 states have internal predecessors, (768), 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-11-08 14:52:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 977 transitions. [2024-11-08 14:52:01,620 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 977 transitions. Word has length 67 [2024-11-08 14:52:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:01,621 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 977 transitions. [2024-11-08 14:52:01,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-11-08 14:52:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 977 transitions. [2024-11-08 14:52:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 14:52:01,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:01,624 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, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 14:52:01,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash -737534943, now seen corresponding path program 1 times [2024-11-08 14:52:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549227911] [2024-11-08 14:52:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:01,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:52:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:02,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:02,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:02,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549227911] [2024-11-08 14:52:02,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549227911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:02,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:02,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:52:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032181947] [2024-11-08 14:52:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:02,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:52:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:52:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:52:02,209 INFO L87 Difference]: Start difference. First operand 601 states and 977 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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-11-08 14:52:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:05,951 INFO L93 Difference]: Finished difference Result 1324 states and 2187 transitions. [2024-11-08 14:52:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:52:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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 68 [2024-11-08 14:52:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:05,958 INFO L225 Difference]: With dead ends: 1324 [2024-11-08 14:52:05,958 INFO L226 Difference]: Without dead ends: 785 [2024-11-08 14:52:05,961 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-11-08 14:52:05,962 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1251 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:05,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1148 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 14:52:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-08 14:52:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 601. [2024-11-08 14:52:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 466 states have (on average 1.6373390557939915) internal successors, (763), 489 states have internal predecessors, (763), 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-11-08 14:52:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 972 transitions. [2024-11-08 14:52:06,062 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 972 transitions. Word has length 68 [2024-11-08 14:52:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:06,062 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 972 transitions. [2024-11-08 14:52:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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-11-08 14:52:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 972 transitions. [2024-11-08 14:52:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 14:52:06,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:06,064 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 14:52:06,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash 865605449, now seen corresponding path program 1 times [2024-11-08 14:52:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:06,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896965765] [2024-11-08 14:52:06,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:06,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:52:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896965765] [2024-11-08 14:52:06,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896965765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:06,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:06,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:52:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632669848] [2024-11-08 14:52:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:06,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:52:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:52:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:52:06,615 INFO L87 Difference]: Start difference. First operand 601 states and 972 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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-11-08 14:52:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:10,446 INFO L93 Difference]: Finished difference Result 1324 states and 2182 transitions. [2024-11-08 14:52:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:52:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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 69 [2024-11-08 14:52:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:10,451 INFO L225 Difference]: With dead ends: 1324 [2024-11-08 14:52:10,451 INFO L226 Difference]: Without dead ends: 785 [2024-11-08 14:52:10,453 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-11-08 14:52:10,454 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 770 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:10,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1162 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 14:52:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-08 14:52:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 601. [2024-11-08 14:52:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 466 states have (on average 1.6266094420600858) internal successors, (758), 489 states have internal predecessors, (758), 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-11-08 14:52:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 967 transitions. [2024-11-08 14:52:10,553 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 967 transitions. Word has length 69 [2024-11-08 14:52:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:10,554 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 967 transitions. [2024-11-08 14:52:10,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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-11-08 14:52:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 967 transitions. [2024-11-08 14:52:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 14:52:10,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:10,555 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:10,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 14:52:10,556 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:10,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -350215162, now seen corresponding path program 1 times [2024-11-08 14:52:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599691313] [2024-11-08 14:52:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:10,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:52:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:11,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:11,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:11,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599691313] [2024-11-08 14:52:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599691313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:11,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:11,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 14:52:11,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141035292] [2024-11-08 14:52:11,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:11,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:52:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:11,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:52:11,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:52:11,147 INFO L87 Difference]: Start difference. First operand 601 states and 967 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (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-11-08 14:52:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:16,523 INFO L93 Difference]: Finished difference Result 1301 states and 2137 transitions. [2024-11-08 14:52:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 14:52:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (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 70 [2024-11-08 14:52:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:16,529 INFO L225 Difference]: With dead ends: 1301 [2024-11-08 14:52:16,529 INFO L226 Difference]: Without dead ends: 777 [2024-11-08 14:52:16,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:52:16,532 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 757 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 5090 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 5216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 5090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:16,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 2069 Invalid, 5216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 5090 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 14:52:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-08 14:52:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 601. [2024-11-08 14:52:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 466 states have (on average 1.6244635193133048) internal successors, (757), 489 states have internal predecessors, (757), 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-11-08 14:52:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 966 transitions. [2024-11-08 14:52:16,634 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 966 transitions. Word has length 70 [2024-11-08 14:52:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:16,635 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 966 transitions. [2024-11-08 14:52:16,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (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-11-08 14:52:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 966 transitions. [2024-11-08 14:52:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 14:52:16,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:16,638 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:16,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 14:52:16,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:16,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1074834150, now seen corresponding path program 1 times [2024-11-08 14:52:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214158492] [2024-11-08 14:52:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:17,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 14:52:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:17,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:17,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:17,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214158492] [2024-11-08 14:52:17,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214158492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:17,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:17,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:52:17,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507831460] [2024-11-08 14:52:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:17,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:52:17,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:52:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:52:17,199 INFO L87 Difference]: Start difference. First operand 601 states and 966 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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-11-08 14:52:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:20,790 INFO L93 Difference]: Finished difference Result 1324 states and 2173 transitions. [2024-11-08 14:52:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:52:20,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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 70 [2024-11-08 14:52:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:20,795 INFO L225 Difference]: With dead ends: 1324 [2024-11-08 14:52:20,795 INFO L226 Difference]: Without dead ends: 785 [2024-11-08 14:52:20,797 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-11-08 14:52:20,798 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 769 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 2724 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1137 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2724 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 14:52:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-08 14:52:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 601. [2024-11-08 14:52:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 466 states have (on average 1.613733905579399) internal successors, (752), 489 states have internal predecessors, (752), 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-11-08 14:52:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 961 transitions. [2024-11-08 14:52:20,920 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 961 transitions. Word has length 70 [2024-11-08 14:52:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:20,921 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 961 transitions. [2024-11-08 14:52:20,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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-11-08 14:52:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 961 transitions. [2024-11-08 14:52:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 14:52:20,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:20,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:20,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 14:52:20,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:20,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash 99805964, now seen corresponding path program 1 times [2024-11-08 14:52:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:20,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662633305] [2024-11-08 14:52:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:52:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662633305] [2024-11-08 14:52:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662633305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:21,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 14:52:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525595145] [2024-11-08 14:52:21,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:52:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:52:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:52:21,496 INFO L87 Difference]: Start difference. First operand 601 states and 961 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (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-11-08 14:52:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:26,750 INFO L93 Difference]: Finished difference Result 1310 states and 2141 transitions. [2024-11-08 14:52:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 14:52:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (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 71 [2024-11-08 14:52:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:26,755 INFO L225 Difference]: With dead ends: 1310 [2024-11-08 14:52:26,755 INFO L226 Difference]: Without dead ends: 783 [2024-11-08 14:52:26,758 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-11-08 14:52:26,758 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 756 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 4998 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 4998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:26,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 2039 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 4998 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 14:52:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-08 14:52:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 604. [2024-11-08 14:52:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 469 states have (on average 1.607675906183369) internal successors, (754), 492 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-11-08 14:52:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 963 transitions. [2024-11-08 14:52:26,884 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 963 transitions. Word has length 71 [2024-11-08 14:52:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:26,884 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 963 transitions. [2024-11-08 14:52:26,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (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-11-08 14:52:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 963 transitions. [2024-11-08 14:52:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 14:52:26,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:26,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:26,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 14:52:26,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:26,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1022473390, now seen corresponding path program 1 times [2024-11-08 14:52:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136909155] [2024-11-08 14:52:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:52:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136909155] [2024-11-08 14:52:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136909155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:52:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125184674] [2024-11-08 14:52:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:52:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:52:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:52:27,357 INFO L87 Difference]: Start difference. First operand 604 states and 963 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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-11-08 14:52:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:30,835 INFO L93 Difference]: Finished difference Result 1333 states and 2173 transitions. [2024-11-08 14:52:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:52:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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 71 [2024-11-08 14:52:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:30,840 INFO L225 Difference]: With dead ends: 1333 [2024-11-08 14:52:30,840 INFO L226 Difference]: Without dead ends: 791 [2024-11-08 14:52:30,842 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-11-08 14:52:30,842 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1249 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:30,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1130 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 14:52:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-08 14:52:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 604. [2024-11-08 14:52:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 469 states have (on average 1.5970149253731343) internal successors, (749), 492 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-11-08 14:52:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 958 transitions. [2024-11-08 14:52:30,964 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 958 transitions. Word has length 71 [2024-11-08 14:52:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:30,964 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 958 transitions. [2024-11-08 14:52:30,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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-11-08 14:52:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 958 transitions. [2024-11-08 14:52:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 14:52:30,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:30,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:30,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 14:52:30,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:30,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash 77192139, now seen corresponding path program 1 times [2024-11-08 14:52:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92874277] [2024-11-08 14:52:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:52:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:31,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:31,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92874277] [2024-11-08 14:52:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92874277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:31,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:31,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:52:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250558139] [2024-11-08 14:52:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:52:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:52:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:52:31,486 INFO L87 Difference]: Start difference. First operand 604 states and 958 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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-11-08 14:52:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:52:35,208 INFO L93 Difference]: Finished difference Result 1314 states and 2138 transitions. [2024-11-08 14:52:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:52:35,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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 72 [2024-11-08 14:52:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:52:35,212 INFO L225 Difference]: With dead ends: 1314 [2024-11-08 14:52:35,212 INFO L226 Difference]: Without dead ends: 787 [2024-11-08 14:52:35,214 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-11-08 14:52:35,215 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 746 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:52:35,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1118 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 14:52:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-08 14:52:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 608. [2024-11-08 14:52:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 473 states have (on average 1.5898520084566596) internal successors, (752), 496 states have internal predecessors, (752), 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-11-08 14:52:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 961 transitions. [2024-11-08 14:52:35,309 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 961 transitions. Word has length 72 [2024-11-08 14:52:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:52:35,309 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 961 transitions. [2024-11-08 14:52:35,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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-11-08 14:52:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 961 transitions. [2024-11-08 14:52:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 14:52:35,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:52:35,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:52:35,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 14:52:35,312 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:52:35,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:52:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1450773931, now seen corresponding path program 1 times [2024-11-08 14:52:35,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:52:35,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940862111] [2024-11-08 14:52:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:52:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:52:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:52:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:52:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:52:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:52:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:52:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:52:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:52:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:52:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940862111] [2024-11-08 14:52:35,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940862111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:52:35,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:52:35,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:52:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246055562] [2024-11-08 14:52:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:52:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:52:35,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:52:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:52:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:52:35,863 INFO L87 Difference]: Start difference. First operand 608 states and 961 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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)