./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:39:52,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:39:52,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:39:52,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:39:52,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:39:52,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:39:52,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:39:52,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:39:52,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:39:52,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:39:52,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:39:52,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:39:52,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:39:52,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:39:52,828 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:39:52,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:39:52,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:39:52,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:39:52,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:39:52,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:39:52,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:39:52,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:39:52,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:39:52,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:39:52,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:39:52,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:39:52,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:39:52,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:39:52,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:39:52,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:39:52,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:39:52,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:39:52,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:39:52,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:39:52,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:39:52,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:39:52,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:39:52,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:39:52,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:39:52,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:39:52,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:39:52,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:39:52,840 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f20249a191004f50add5285446ee5ffba043f1ff9b40e0e115c641082e595e2 [2024-10-11 02:39:53,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:39:53,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:39:53,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:39:53,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:39:53,131 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:39:53,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2024-10-11 02:39:54,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:39:54,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:39:54,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2024-10-11 02:39:54,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3eee84d96/4e20e3418c5b41bc831cc21fb1903e64/FLAG09957ddfe [2024-10-11 02:39:54,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3eee84d96/4e20e3418c5b41bc831cc21fb1903e64 [2024-10-11 02:39:54,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:39:54,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:39:54,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:39:54,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:39:54,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:39:54,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:54" (1/1) ... [2024-10-11 02:39:54,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12246aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:54, skipping insertion in model container [2024-10-11 02:39:54,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:54" (1/1) ... [2024-10-11 02:39:54,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:39:55,157 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c[17414,17427] [2024-10-11 02:39:55,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:39:55,422 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:39:55,433 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-11 02:39:55,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2024-10-11 02:39:55,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [725] [2024-10-11 02:39:55,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [739] [2024-10-11 02:39:55,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [905] [2024-10-11 02:39:55,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2574] [2024-10-11 02:39:55,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2940] [2024-10-11 02:39:55,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2978] [2024-10-11 02:39:55,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3330] [2024-10-11 02:39:55,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3448] [2024-10-11 02:39:55,469 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c[17414,17427] [2024-10-11 02:39:55,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:39:55,629 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:39:55,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55 WrapperNode [2024-10-11 02:39:55,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:39:55,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:39:55,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:39:55,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:39:55,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,785 INFO L138 Inliner]: procedures = 99, calls = 352, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 933 [2024-10-11 02:39:55,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:39:55,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:39:55,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:39:55,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:39:55,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,839 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:39:55,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:39:55,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:39:55,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:39:55,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:39:55,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (1/1) ... [2024-10-11 02:39:55,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:39:55,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:39:55,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:39:55,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:39:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:39:56,008 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:39:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:39:56,008 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:39:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:39:56,009 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:39:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:39:56,009 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:39:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:39:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:39:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:39:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:39:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:39:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:39:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:39:56,011 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:39:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:39:56,012 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:39:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:39:56,012 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:39:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:39:56,012 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:39:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:39:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:39:56,012 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:39:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:39:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:39:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:39:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:39:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:39:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:39:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:39:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:39:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:39:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:39:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:39:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:39:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:39:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:39:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:39:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:39:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:39:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:39:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:39:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:39:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:39:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:39:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:39:56,016 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:39:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-11 02:39:56,016 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-11 02:39:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:39:56,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:39:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:39:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:39:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:39:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:39:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:39:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:39:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:39:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:39:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:39:56,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:39:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:39:56,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:39:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:39:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:39:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:39:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:39:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:39:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:39:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:39:56,022 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:39:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:39:56,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:39:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:39:56,022 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:39:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-11 02:39:56,022 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-11 02:39:56,219 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:39:56,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:39:57,433 INFO L? ?]: Removed 478 outVars from TransFormulas that were not future-live. [2024-10-11 02:39:57,434 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:39:57,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:39:57,553 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:39:57,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:57 BoogieIcfgContainer [2024-10-11 02:39:57,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:39:57,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:39:57,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:39:57,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:39:57,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:54" (1/3) ... [2024-10-11 02:39:57,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62768bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:57, skipping insertion in model container [2024-10-11 02:39:57,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:55" (2/3) ... [2024-10-11 02:39:57,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62768bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:57, skipping insertion in model container [2024-10-11 02:39:57,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:57" (3/3) ... [2024-10-11 02:39:57,561 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2024-10-11 02:39:57,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:39:57,576 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:39:57,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:39:57,676 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;@5e6081b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:39:57,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:39:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 578 states, 445 states have (on average 1.7101123595505618) internal successors, (761), 468 states have internal predecessors, (761), 103 states have call successors, (103), 28 states have call predecessors, (103), 28 states have return successors, (103), 96 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:39:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 02:39:57,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:57,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:57,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:57,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash 859449987, now seen corresponding path program 1 times [2024-10-11 02:39:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952637509] [2024-10-11 02:39:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:39:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:39:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:58,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:58,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952637509] [2024-10-11 02:39:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952637509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:58,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:58,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:39:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404857861] [2024-10-11 02:39:58,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:58,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:39:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:39:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:39:59,007 INFO L87 Difference]: Start difference. First operand has 578 states, 445 states have (on average 1.7101123595505618) internal successors, (761), 468 states have internal predecessors, (761), 103 states have call successors, (103), 28 states have call predecessors, (103), 28 states have return successors, (103), 96 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:04,170 INFO L93 Difference]: Finished difference Result 1292 states and 2190 transitions. [2024-10-11 02:40:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:40:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-11 02:40:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:04,196 INFO L225 Difference]: With dead ends: 1292 [2024-10-11 02:40:04,196 INFO L226 Difference]: Without dead ends: 723 [2024-10-11 02:40:04,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:40:04,209 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1201 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2765 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:04,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1033 Invalid, 3033 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [268 Valid, 2765 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 02:40:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-11 02:40:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 574. [2024-10-11 02:40:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 443 states have (on average 1.6997742663656885) internal successors, (753), 464 states have internal predecessors, (753), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:40:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 954 transitions. [2024-10-11 02:40:04,423 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 954 transitions. Word has length 52 [2024-10-11 02:40:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:04,423 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 954 transitions. [2024-10-11 02:40:04,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 954 transitions. [2024-10-11 02:40:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:40:04,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:04,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:04,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:40:04,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash -472759716, now seen corresponding path program 1 times [2024-10-11 02:40:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426941332] [2024-10-11 02:40:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:40:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:05,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:05,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426941332] [2024-10-11 02:40:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426941332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:05,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:05,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62544368] [2024-10-11 02:40:05,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:05,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:05,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:05,168 INFO L87 Difference]: Start difference. First operand 574 states and 954 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:09,394 INFO L93 Difference]: Finished difference Result 1285 states and 2163 transitions. [2024-10-11 02:40:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:40:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-11 02:40:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:09,405 INFO L225 Difference]: With dead ends: 1285 [2024-10-11 02:40:09,405 INFO L226 Difference]: Without dead ends: 723 [2024-10-11 02:40:09,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-10-11 02:40:09,409 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1199 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:09,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1019 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 02:40:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-11 02:40:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 574. [2024-10-11 02:40:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 443 states have (on average 1.6975169300225734) internal successors, (752), 464 states have internal predecessors, (752), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:40:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 953 transitions. [2024-10-11 02:40:09,508 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 953 transitions. Word has length 54 [2024-10-11 02:40:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:09,508 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 953 transitions. [2024-10-11 02:40:09,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 953 transitions. [2024-10-11 02:40:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 02:40:09,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:09,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:09,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:40:09,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1164601473, now seen corresponding path program 1 times [2024-10-11 02:40:09,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:09,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38802019] [2024-10-11 02:40:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:09,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:09,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:40:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:40:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38802019] [2024-10-11 02:40:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38802019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:10,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:10,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653037806] [2024-10-11 02:40:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:10,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:10,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:10,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:10,141 INFO L87 Difference]: Start difference. First operand 574 states and 953 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:14,010 INFO L93 Difference]: Finished difference Result 1285 states and 2162 transitions. [2024-10-11 02:40:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:40:14,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-10-11 02:40:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:14,017 INFO L225 Difference]: With dead ends: 1285 [2024-10-11 02:40:14,017 INFO L226 Difference]: Without dead ends: 723 [2024-10-11 02:40:14,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:40:14,021 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1200 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 2734 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 2734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:14,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 998 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 2734 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:40:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-11 02:40:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 574. [2024-10-11 02:40:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 443 states have (on average 1.6952595936794583) internal successors, (751), 464 states have internal predecessors, (751), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:40:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 952 transitions. [2024-10-11 02:40:14,154 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 952 transitions. Word has length 55 [2024-10-11 02:40:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:14,155 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 952 transitions. [2024-10-11 02:40:14,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 952 transitions. [2024-10-11 02:40:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:40:14,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:14,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:14,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:40:14,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:14,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:14,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1843036224, now seen corresponding path program 1 times [2024-10-11 02:40:14,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:14,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251768482] [2024-10-11 02:40:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:40:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:40:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:14,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251768482] [2024-10-11 02:40:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251768482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947235084] [2024-10-11 02:40:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:14,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:14,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:14,775 INFO L87 Difference]: Start difference. First operand 574 states and 952 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:19,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:19,180 INFO L93 Difference]: Finished difference Result 1285 states and 2161 transitions. [2024-10-11 02:40:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:40:19,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-11 02:40:19,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:19,187 INFO L225 Difference]: With dead ends: 1285 [2024-10-11 02:40:19,187 INFO L226 Difference]: Without dead ends: 723 [2024-10-11 02:40:19,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:40:19,195 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 711 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:19,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1027 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:40:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-11 02:40:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 574. [2024-10-11 02:40:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 443 states have (on average 1.693002257336343) internal successors, (750), 464 states have internal predecessors, (750), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:40:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 951 transitions. [2024-10-11 02:40:19,316 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 951 transitions. Word has length 56 [2024-10-11 02:40:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:19,316 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 951 transitions. [2024-10-11 02:40:19,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 951 transitions. [2024-10-11 02:40:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 02:40:19,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:19,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:19,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:40:19,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:19,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2105853789, now seen corresponding path program 1 times [2024-10-11 02:40:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998937091] [2024-10-11 02:40:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:40:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:40:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:19,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:19,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998937091] [2024-10-11 02:40:19,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998937091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:19,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:19,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:19,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465047461] [2024-10-11 02:40:19,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:19,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:19,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:19,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:19,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:19,877 INFO L87 Difference]: Start difference. First operand 574 states and 951 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:23,843 INFO L93 Difference]: Finished difference Result 1285 states and 2160 transitions. [2024-10-11 02:40:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:40:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-11 02:40:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:23,849 INFO L225 Difference]: With dead ends: 1285 [2024-10-11 02:40:23,849 INFO L226 Difference]: Without dead ends: 723 [2024-10-11 02:40:23,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:40:23,853 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1191 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:23,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1019 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2731 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:40:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-11 02:40:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 574. [2024-10-11 02:40:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 443 states have (on average 1.690744920993228) internal successors, (749), 464 states have internal predecessors, (749), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 02:40:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 950 transitions. [2024-10-11 02:40:23,955 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 950 transitions. Word has length 57 [2024-10-11 02:40:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:23,956 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 950 transitions. [2024-10-11 02:40:23,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 950 transitions. [2024-10-11 02:40:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:40:23,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:23,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:23,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:40:23,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1925526820, now seen corresponding path program 1 times [2024-10-11 02:40:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168488229] [2024-10-11 02:40:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:40:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168488229] [2024-10-11 02:40:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168488229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:40:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032767516] [2024-10-11 02:40:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:40:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:24,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:40:24,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:40:24,679 INFO L87 Difference]: Start difference. First operand 574 states and 950 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:30,164 INFO L93 Difference]: Finished difference Result 1261 states and 2109 transitions. [2024-10-11 02:40:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:40:30,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2024-10-11 02:40:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:30,169 INFO L225 Difference]: With dead ends: 1261 [2024-10-11 02:40:30,169 INFO L226 Difference]: Without dead ends: 747 [2024-10-11 02:40:30,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:40:30,173 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1282 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 5132 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 5406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 5132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:30,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 1871 Invalid, 5406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 5132 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 02:40:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-11 02:40:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 586. [2024-10-11 02:40:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 452 states have (on average 1.6880530973451326) internal successors, (763), 475 states have internal predecessors, (763), 104 states have call successors, (104), 28 states have call predecessors, (104), 29 states have return successors, (101), 96 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:40:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 968 transitions. [2024-10-11 02:40:30,276 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 968 transitions. Word has length 58 [2024-10-11 02:40:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:30,277 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 968 transitions. [2024-10-11 02:40:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 968 transitions. [2024-10-11 02:40:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:40:30,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:30,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:30,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:40:30,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash -398501019, now seen corresponding path program 1 times [2024-10-11 02:40:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:30,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271354165] [2024-10-11 02:40:30,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:30,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:40:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:30,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:30,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271354165] [2024-10-11 02:40:30,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271354165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:30,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90604272] [2024-10-11 02:40:30,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:30,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:30,824 INFO L87 Difference]: Start difference. First operand 586 states and 968 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:34,368 INFO L93 Difference]: Finished difference Result 1283 states and 2147 transitions. [2024-10-11 02:40:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-10-11 02:40:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:34,373 INFO L225 Difference]: With dead ends: 1283 [2024-10-11 02:40:34,373 INFO L226 Difference]: Without dead ends: 753 [2024-10-11 02:40:34,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:34,376 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1259 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:34,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 998 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 02:40:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-11 02:40:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 586. [2024-10-11 02:40:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 452 states have (on average 1.676991150442478) internal successors, (758), 475 states have internal predecessors, (758), 104 states have call successors, (104), 28 states have call predecessors, (104), 29 states have return successors, (101), 96 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:40:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 963 transitions. [2024-10-11 02:40:34,497 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 963 transitions. Word has length 58 [2024-10-11 02:40:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:34,497 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 963 transitions. [2024-10-11 02:40:34,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 963 transitions. [2024-10-11 02:40:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:40:34,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:34,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:34,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:40:34,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:34,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 988058791, now seen corresponding path program 1 times [2024-10-11 02:40:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679877622] [2024-10-11 02:40:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:34,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:40:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679877622] [2024-10-11 02:40:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679877622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:35,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:35,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:35,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822914413] [2024-10-11 02:40:35,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:35,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:35,039 INFO L87 Difference]: Start difference. First operand 586 states and 963 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:38,689 INFO L93 Difference]: Finished difference Result 1283 states and 2142 transitions. [2024-10-11 02:40:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:38,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2024-10-11 02:40:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:38,695 INFO L225 Difference]: With dead ends: 1283 [2024-10-11 02:40:38,695 INFO L226 Difference]: Without dead ends: 753 [2024-10-11 02:40:38,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:38,698 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 767 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:38,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1036 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:40:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-11 02:40:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 586. [2024-10-11 02:40:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 452 states have (on average 1.665929203539823) internal successors, (753), 475 states have internal predecessors, (753), 104 states have call successors, (104), 28 states have call predecessors, (104), 29 states have return successors, (101), 96 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:40:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 958 transitions. [2024-10-11 02:40:38,801 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 958 transitions. Word has length 59 [2024-10-11 02:40:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:38,801 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 958 transitions. [2024-10-11 02:40:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 958 transitions. [2024-10-11 02:40:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 02:40:38,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:38,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:38,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:40:38,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:38,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash -260294656, now seen corresponding path program 1 times [2024-10-11 02:40:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665024815] [2024-10-11 02:40:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:40:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:39,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:39,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:39,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665024815] [2024-10-11 02:40:39,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665024815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:39,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:39,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302058486] [2024-10-11 02:40:39,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:39,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:39,281 INFO L87 Difference]: Start difference. First operand 586 states and 958 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:42,638 INFO L93 Difference]: Finished difference Result 1283 states and 2137 transitions. [2024-10-11 02:40:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:42,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-10-11 02:40:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:42,642 INFO L225 Difference]: With dead ends: 1283 [2024-10-11 02:40:42,643 INFO L226 Difference]: Without dead ends: 753 [2024-10-11 02:40:42,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:42,645 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1253 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:42,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1019 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:40:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-11 02:40:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 586. [2024-10-11 02:40:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 452 states have (on average 1.654867256637168) internal successors, (748), 475 states have internal predecessors, (748), 104 states have call successors, (104), 28 states have call predecessors, (104), 29 states have return successors, (101), 96 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-11 02:40:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 953 transitions. [2024-10-11 02:40:42,751 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 953 transitions. Word has length 60 [2024-10-11 02:40:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:42,751 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 953 transitions. [2024-10-11 02:40:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:40:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 953 transitions. [2024-10-11 02:40:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 02:40:42,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:42,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:42,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:40:42,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:42,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 831966978, now seen corresponding path program 1 times [2024-10-11 02:40:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131414992] [2024-10-11 02:40:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:43,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:40:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131414992] [2024-10-11 02:40:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131414992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:40:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63678057] [2024-10-11 02:40:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:43,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:40:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:40:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:40:43,394 INFO L87 Difference]: Start difference. First operand 586 states and 953 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:49,785 INFO L93 Difference]: Finished difference Result 1269 states and 2109 transitions. [2024-10-11 02:40:49,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:40:49,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-10-11 02:40:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:49,791 INFO L225 Difference]: With dead ends: 1269 [2024-10-11 02:40:49,791 INFO L226 Difference]: Without dead ends: 753 [2024-10-11 02:40:49,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:40:49,794 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 1242 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 7445 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 7729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 7445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:49,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 2585 Invalid, 7729 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [284 Valid, 7445 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:40:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-11 02:40:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 590. [2024-10-11 02:40:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 455 states have (on average 1.6483516483516483) internal successors, (750), 478 states have internal predecessors, (750), 104 states have call successors, (104), 28 states have call predecessors, (104), 30 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2024-10-11 02:40:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 957 transitions. [2024-10-11 02:40:49,899 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 957 transitions. Word has length 61 [2024-10-11 02:40:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:49,901 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 957 transitions. [2024-10-11 02:40:49,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:40:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 957 transitions. [2024-10-11 02:40:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 02:40:49,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:49,903 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:49,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:40:49,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:49,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:49,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1400363499, now seen corresponding path program 1 times [2024-10-11 02:40:49,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:49,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256126573] [2024-10-11 02:40:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:40:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:40:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256126573] [2024-10-11 02:40:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256126573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:40:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918834280] [2024-10-11 02:40:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:40:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:40:50,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:40:50,417 INFO L87 Difference]: Start difference. First operand 590 states and 957 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:53,839 INFO L93 Difference]: Finished difference Result 1293 states and 2141 transitions. [2024-10-11 02:40:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:40:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-10-11 02:40:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:53,845 INFO L225 Difference]: With dead ends: 1293 [2024-10-11 02:40:53,845 INFO L226 Difference]: Without dead ends: 759 [2024-10-11 02:40:53,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:40:53,847 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1252 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:53,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1000 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:40:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-10-11 02:40:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 590. [2024-10-11 02:40:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 455 states have (on average 1.6373626373626373) internal successors, (745), 478 states have internal predecessors, (745), 104 states have call successors, (104), 28 states have call predecessors, (104), 30 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2024-10-11 02:40:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 952 transitions. [2024-10-11 02:40:53,956 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 952 transitions. Word has length 66 [2024-10-11 02:40:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:53,956 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 952 transitions. [2024-10-11 02:40:53,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:40:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 952 transitions. [2024-10-11 02:40:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 02:40:53,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:53,958 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:53,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:40:53,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:53,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2113037338, now seen corresponding path program 1 times [2024-10-11 02:40:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:53,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083393158] [2024-10-11 02:40:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:40:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:40:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:40:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:40:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083393158] [2024-10-11 02:40:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083393158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:40:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965741183] [2024-10-11 02:40:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:40:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:54,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:40:54,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:40:54,513 INFO L87 Difference]: Start difference. First operand 590 states and 952 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:40:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:59,602 INFO L93 Difference]: Finished difference Result 1281 states and 2111 transitions. [2024-10-11 02:40:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:40:59,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 67 [2024-10-11 02:40:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:59,607 INFO L225 Difference]: With dead ends: 1281 [2024-10-11 02:40:59,607 INFO L226 Difference]: Without dead ends: 759 [2024-10-11 02:40:59,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:40:59,610 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 1239 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 4970 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 5250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 4970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:59,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 1789 Invalid, 5250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 4970 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 02:40:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-10-11 02:40:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 593. [2024-10-11 02:40:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 458 states have (on average 1.6310043668122272) internal successors, (747), 481 states have internal predecessors, (747), 104 states have call successors, (104), 28 states have call predecessors, (104), 30 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2024-10-11 02:40:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 954 transitions. [2024-10-11 02:40:59,714 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 954 transitions. Word has length 67 [2024-10-11 02:40:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:59,715 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 954 transitions. [2024-10-11 02:40:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:40:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 954 transitions. [2024-10-11 02:40:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 02:40:59,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:59,716 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:59,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:40:59,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:59,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash -261796548, now seen corresponding path program 1 times [2024-10-11 02:40:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:59,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947720594] [2024-10-11 02:40:59,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:59,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:59,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:41:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:41:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:41:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:41:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:00,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947720594] [2024-10-11 02:41:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947720594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:00,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:00,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:41:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961098650] [2024-10-11 02:41:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:00,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:41:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:41:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:41:00,300 INFO L87 Difference]: Start difference. First operand 593 states and 954 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:41:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:03,693 INFO L93 Difference]: Finished difference Result 1302 states and 2141 transitions. [2024-10-11 02:41:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:41:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-10-11 02:41:03,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:03,698 INFO L225 Difference]: With dead ends: 1302 [2024-10-11 02:41:03,698 INFO L226 Difference]: Without dead ends: 765 [2024-10-11 02:41:03,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:03,701 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1245 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:03,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 1025 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2639 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:41:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-11 02:41:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 593. [2024-10-11 02:41:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 458 states have (on average 1.6200873362445414) internal successors, (742), 481 states have internal predecessors, (742), 104 states have call successors, (104), 28 states have call predecessors, (104), 30 states have return successors, (103), 97 states have call predecessors, (103), 99 states have call successors, (103) [2024-10-11 02:41:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 949 transitions. [2024-10-11 02:41:03,828 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 949 transitions. Word has length 67 [2024-10-11 02:41:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:03,829 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 949 transitions. [2024-10-11 02:41:03,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:41:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 949 transitions. [2024-10-11 02:41:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 02:41:03,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:03,830 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:41:03,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:41:03,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:03,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash -696869478, now seen corresponding path program 1 times [2024-10-11 02:41:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:03,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069643537] [2024-10-11 02:41:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:03,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:41:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:41:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:41:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:41:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:41:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069643537] [2024-10-11 02:41:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069643537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:41:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320125716] [2024-10-11 02:41:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:04,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:41:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:04,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:41:04,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:04,433 INFO L87 Difference]: Start difference. First operand 593 states and 949 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:41:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:12,828 INFO L93 Difference]: Finished difference Result 1595 states and 2612 transitions. [2024-10-11 02:41:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 02:41:12,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2024-10-11 02:41:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:12,837 INFO L225 Difference]: With dead ends: 1595 [2024-10-11 02:41:12,837 INFO L226 Difference]: Without dead ends: 1073 [2024-10-11 02:41:12,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2024-10-11 02:41:12,840 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 2312 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 8990 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 9551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 8990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:12,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 2116 Invalid, 9551 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [561 Valid, 8990 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 02:41:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-10-11 02:41:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 861. [2024-10-11 02:41:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 666 states have (on average 1.6126126126126126) internal successors, (1074), 689 states have internal predecessors, (1074), 148 states have call successors, (148), 43 states have call predecessors, (148), 46 states have return successors, (153), 142 states have call predecessors, (153), 143 states have call successors, (153) [2024-10-11 02:41:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1375 transitions. [2024-10-11 02:41:13,042 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1375 transitions. Word has length 68 [2024-10-11 02:41:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:13,043 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1375 transitions. [2024-10-11 02:41:13,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:41:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1375 transitions. [2024-10-11 02:41:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 02:41:13,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:13,045 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-10-11 02:41:13,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:41:13,045 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:13,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1654985882, now seen corresponding path program 1 times [2024-10-11 02:41:13,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:13,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439213097] [2024-10-11 02:41:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:41:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:41:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:41:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:41:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:41:13,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439213097] [2024-10-11 02:41:13,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439213097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:13,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:13,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:41:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240908196] [2024-10-11 02:41:13,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:13,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:41:13,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:13,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:41:13,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:41:13,573 INFO L87 Difference]: Start difference. First operand 861 states and 1375 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, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)