./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:26:00,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:26:00,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:26:00,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:26:00,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:26:00,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:26:00,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:26:00,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:26:00,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:26:00,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:26:00,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:26:00,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:26:00,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:26:00,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:26:00,529 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:26:00,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:26:00,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:26:00,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:26:00,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:26:00,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:26:00,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:26:00,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:26:00,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:26:00,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:26:00,538 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:26:00,538 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:26:00,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:26:00,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:26:00,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:26:00,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:26:00,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:26:00,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:26:00,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:26:00,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:26:00,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:26:00,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:26:00,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:26:00,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:26:00,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:26:00,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:26:00,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:26:00,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:26:00,549 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e [2024-10-13 06:26:01,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:26:01,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:26:01,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:26:01,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:26:01,091 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:26:01,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-10-13 06:26:03,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:26:03,345 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:26:03,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-10-13 06:26:03,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ed61f75/72a94b4bf54a471fbbd7c1f96eb22ddc/FLAG3c5599072 [2024-10-13 06:26:03,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ed61f75/72a94b4bf54a471fbbd7c1f96eb22ddc [2024-10-13 06:26:03,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:26:03,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:26:03,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:26:03,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:26:03,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:26:03,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:03,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aafda41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03, skipping insertion in model container [2024-10-13 06:26:03,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:03,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:26:03,663 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-10-13 06:26:03,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:26:03,788 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:26:03,802 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-10-13 06:26:03,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:26:03,902 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:26:03,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03 WrapperNode [2024-10-13 06:26:03,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:26:03,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:26:03,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:26:03,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:26:03,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:03,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:03,998 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-10-13 06:26:03,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:26:04,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:26:04,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:26:04,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:26:04,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,052 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:26:04,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:26:04,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:26:04,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:26:04,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:26:04,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (1/1) ... [2024-10-13 06:26:04,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:26:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:26:04,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:26:04,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:26:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:26:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:26:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:26:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:26:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:26:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:26:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:26:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:26:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:26:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:26:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:26:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:26:04,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:26:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:26:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:26:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:26:04,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:26:04,297 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:26:04,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:26:04,876 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-13 06:26:04,876 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:26:04,910 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:26:04,911 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:26:04,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:26:04 BoogieIcfgContainer [2024-10-13 06:26:04,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:26:04,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:26:04,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:26:04,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:26:04,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:26:03" (1/3) ... [2024-10-13 06:26:04,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348493dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:26:04, skipping insertion in model container [2024-10-13 06:26:04,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:03" (2/3) ... [2024-10-13 06:26:04,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348493dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:26:04, skipping insertion in model container [2024-10-13 06:26:04,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:26:04" (3/3) ... [2024-10-13 06:26:04,920 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-2.i [2024-10-13 06:26:04,938 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:26:04,938 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:26:05,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:26:05,019 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;@53fbbd05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:26:05,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:26:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:05,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:26:05,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:05,039 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:05,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:05,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1813209465, now seen corresponding path program 1 times [2024-10-13 06:26:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545466384] [2024-10-13 06:26:05,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:05,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545466384] [2024-10-13 06:26:05,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545466384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:05,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:26:05,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175426603] [2024-10-13 06:26:05,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:05,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:26:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:05,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:26:05,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:26:05,670 INFO L87 Difference]: Start difference. First operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:05,743 INFO L93 Difference]: Finished difference Result 191 states and 304 transitions. [2024-10-13 06:26:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:26:05,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-13 06:26:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:05,816 INFO L225 Difference]: With dead ends: 191 [2024-10-13 06:26:05,820 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 06:26:05,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:26:05,839 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:05,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 06:26:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-13 06:26:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-10-13 06:26:06,033 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 95 [2024-10-13 06:26:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-10-13 06:26:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-10-13 06:26:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:26:06,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:06,045 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:06,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:26:06,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:06,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:06,047 INFO L85 PathProgramCache]: Analyzing trace with hash -241283507, now seen corresponding path program 1 times [2024-10-13 06:26:06,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315246267] [2024-10-13 06:26:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315246267] [2024-10-13 06:26:06,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315246267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:06,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:06,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:26:06,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377674090] [2024-10-13 06:26:06,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:06,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:26:06,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:26:06,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:06,341 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:06,389 INFO L93 Difference]: Finished difference Result 190 states and 285 transitions. [2024-10-13 06:26:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:26:06,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-13 06:26:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:06,399 INFO L225 Difference]: With dead ends: 190 [2024-10-13 06:26:06,399 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 06:26:06,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:06,401 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:06,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 06:26:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 06:26:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2024-10-13 06:26:06,419 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 95 [2024-10-13 06:26:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:06,421 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2024-10-13 06:26:06,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2024-10-13 06:26:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:26:06,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:06,430 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:06,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:26:06,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash -828089521, now seen corresponding path program 1 times [2024-10-13 06:26:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793274423] [2024-10-13 06:26:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793274423] [2024-10-13 06:26:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793274423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:06,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:06,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:26:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724216751] [2024-10-13 06:26:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:06,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:26:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:26:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:06,696 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:06,730 INFO L93 Difference]: Finished difference Result 193 states and 288 transitions. [2024-10-13 06:26:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:26:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-13 06:26:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:06,732 INFO L225 Difference]: With dead ends: 193 [2024-10-13 06:26:06,733 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 06:26:06,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:06,734 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:06,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 06:26:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-13 06:26:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2024-10-13 06:26:06,744 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2024-10-13 06:26:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:06,744 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2024-10-13 06:26:06,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2024-10-13 06:26:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:26:06,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:06,746 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:06,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:26:06,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:06,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -755702963, now seen corresponding path program 1 times [2024-10-13 06:26:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667633326] [2024-10-13 06:26:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:07,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667633326] [2024-10-13 06:26:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667633326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:26:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037002251] [2024-10-13 06:26:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:26:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:26:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:07,065 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:07,106 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2024-10-13 06:26:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:26:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-13 06:26:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:07,112 INFO L225 Difference]: With dead ends: 197 [2024-10-13 06:26:07,112 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 06:26:07,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:07,115 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:07,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 06:26:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-13 06:26:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-10-13 06:26:07,136 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 95 [2024-10-13 06:26:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:07,137 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-10-13 06:26:07,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-10-13 06:26:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:26:07,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:07,139 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:07,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:26:07,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:07,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 159798845, now seen corresponding path program 1 times [2024-10-13 06:26:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:07,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502931728] [2024-10-13 06:26:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502931728] [2024-10-13 06:26:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502931728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:07,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:26:07,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216272621] [2024-10-13 06:26:07,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:07,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:26:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:26:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:07,522 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:07,636 INFO L93 Difference]: Finished difference Result 243 states and 359 transitions. [2024-10-13 06:26:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:26:07,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-13 06:26:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:07,639 INFO L225 Difference]: With dead ends: 243 [2024-10-13 06:26:07,639 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 06:26:07,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:07,644 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:07,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 271 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:26:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 06:26:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2024-10-13 06:26:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2024-10-13 06:26:07,660 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 98 [2024-10-13 06:26:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:07,661 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2024-10-13 06:26:07,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2024-10-13 06:26:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:26:07,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:07,663 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:07,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:26:07,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1116795928, now seen corresponding path program 1 times [2024-10-13 06:26:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620557951] [2024-10-13 06:26:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:07,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620557951] [2024-10-13 06:26:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620557951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:26:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431335652] [2024-10-13 06:26:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:26:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:26:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:07,761 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:07,784 INFO L93 Difference]: Finished difference Result 236 states and 351 transitions. [2024-10-13 06:26:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:26:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-13 06:26:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:07,786 INFO L225 Difference]: With dead ends: 236 [2024-10-13 06:26:07,786 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 06:26:07,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:07,788 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:07,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 06:26:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 06:26:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2024-10-13 06:26:07,796 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 98 [2024-10-13 06:26:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:07,797 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2024-10-13 06:26:07,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2024-10-13 06:26:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:26:07,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:07,798 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:07,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:26:07,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:07,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 307449302, now seen corresponding path program 1 times [2024-10-13 06:26:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798028894] [2024-10-13 06:26:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798028894] [2024-10-13 06:26:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798028894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:09,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:26:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618429242] [2024-10-13 06:26:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:09,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:26:09,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:09,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:26:09,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:26:09,519 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:10,058 INFO L93 Difference]: Finished difference Result 298 states and 436 transitions. [2024-10-13 06:26:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:26:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2024-10-13 06:26:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:10,061 INFO L225 Difference]: With dead ends: 298 [2024-10-13 06:26:10,061 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 06:26:10,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:10,062 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 60 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:10,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 621 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:26:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 06:26:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-10-13 06:26:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.4375) internal successors, (230), 161 states have internal predecessors, (230), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:26:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 258 transitions. [2024-10-13 06:26:10,075 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 258 transitions. Word has length 98 [2024-10-13 06:26:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:10,075 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 258 transitions. [2024-10-13 06:26:10,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2024-10-13 06:26:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:26:10,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:10,077 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:10,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:26:10,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1599756405, now seen corresponding path program 1 times [2024-10-13 06:26:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470406645] [2024-10-13 06:26:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:10,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:26:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119912329] [2024-10-13 06:26:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:10,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:26:10,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:26:10,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:26:10,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:26:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:10,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:26:10,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:10,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:26:10,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:10,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470406645] [2024-10-13 06:26:10,975 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:26:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119912329] [2024-10-13 06:26:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119912329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:26:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130771779] [2024-10-13 06:26:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:26:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:10,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:26:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:10,978 INFO L87 Difference]: Start difference. First operand 177 states and 258 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:11,235 INFO L93 Difference]: Finished difference Result 494 states and 723 transitions. [2024-10-13 06:26:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:26:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-13 06:26:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:11,240 INFO L225 Difference]: With dead ends: 494 [2024-10-13 06:26:11,241 INFO L226 Difference]: Without dead ends: 318 [2024-10-13 06:26:11,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:26:11,244 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 126 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:11,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 315 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:26:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-13 06:26:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 249. [2024-10-13 06:26:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 219 states have (on average 1.4200913242009132) internal successors, (311), 220 states have internal predecessors, (311), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 363 transitions. [2024-10-13 06:26:11,282 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 363 transitions. Word has length 100 [2024-10-13 06:26:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:11,282 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 363 transitions. [2024-10-13 06:26:11,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 363 transitions. [2024-10-13 06:26:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:26:11,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:11,285 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:11,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:26:11,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:26:11,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:11,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:11,491 INFO L85 PathProgramCache]: Analyzing trace with hash -805209127, now seen corresponding path program 1 times [2024-10-13 06:26:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912783694] [2024-10-13 06:26:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912783694] [2024-10-13 06:26:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912783694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:13,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:26:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870912762] [2024-10-13 06:26:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:26:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:26:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:26:13,420 INFO L87 Difference]: Start difference. First operand 249 states and 363 transitions. Second operand has 10 states, 6 states have (on average 7.333333333333333) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-13 06:26:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:14,401 INFO L93 Difference]: Finished difference Result 525 states and 755 transitions. [2024-10-13 06:26:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:26:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 6 states have (on average 7.333333333333333) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 101 [2024-10-13 06:26:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:14,404 INFO L225 Difference]: With dead ends: 525 [2024-10-13 06:26:14,405 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 06:26:14,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:14,406 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 56 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:14,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 619 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:26:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 06:26:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 271. [2024-10-13 06:26:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 241 states have (on average 1.4107883817427387) internal successors, (340), 242 states have internal predecessors, (340), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 392 transitions. [2024-10-13 06:26:14,436 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 392 transitions. Word has length 101 [2024-10-13 06:26:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:14,437 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 392 transitions. [2024-10-13 06:26:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 6 states have (on average 7.333333333333333) internal successors, (44), 10 states have internal predecessors, (44), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-13 06:26:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 392 transitions. [2024-10-13 06:26:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:26:14,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:14,438 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:14,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:26:14,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:14,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1198236137, now seen corresponding path program 1 times [2024-10-13 06:26:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:14,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544115441] [2024-10-13 06:26:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544115441] [2024-10-13 06:26:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544115441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:16,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:26:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942989944] [2024-10-13 06:26:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:26:16,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:26:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:26:16,104 INFO L87 Difference]: Start difference. First operand 271 states and 392 transitions. Second operand has 13 states, 11 states have (on average 4.0) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:17,132 INFO L93 Difference]: Finished difference Result 621 states and 901 transitions. [2024-10-13 06:26:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:26:17,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2024-10-13 06:26:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:17,135 INFO L225 Difference]: With dead ends: 621 [2024-10-13 06:26:17,135 INFO L226 Difference]: Without dead ends: 427 [2024-10-13 06:26:17,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:26:17,136 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 71 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:17,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 779 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:26:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-13 06:26:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 341. [2024-10-13 06:26:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 311 states have (on average 1.4308681672025723) internal successors, (445), 312 states have internal predecessors, (445), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 497 transitions. [2024-10-13 06:26:17,152 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 497 transitions. Word has length 101 [2024-10-13 06:26:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:17,152 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 497 transitions. [2024-10-13 06:26:17,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 497 transitions. [2024-10-13 06:26:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:26:17,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:17,154 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:17,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:26:17,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:17,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash -976607139, now seen corresponding path program 1 times [2024-10-13 06:26:17,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:17,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552117939] [2024-10-13 06:26:17,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:17,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:17,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552117939] [2024-10-13 06:26:17,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552117939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:17,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:17,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:26:17,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26346096] [2024-10-13 06:26:17,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:17,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:26:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:17,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:26:17,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:26:17,939 INFO L87 Difference]: Start difference. First operand 341 states and 497 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:18,252 INFO L93 Difference]: Finished difference Result 669 states and 970 transitions. [2024-10-13 06:26:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:26:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-13 06:26:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:18,254 INFO L225 Difference]: With dead ends: 669 [2024-10-13 06:26:18,254 INFO L226 Difference]: Without dead ends: 435 [2024-10-13 06:26:18,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:26:18,255 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 52 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:18,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 446 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:26:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-13 06:26:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 344. [2024-10-13 06:26:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 314 states have (on average 1.429936305732484) internal successors, (449), 315 states have internal predecessors, (449), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 501 transitions. [2024-10-13 06:26:18,269 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 501 transitions. Word has length 103 [2024-10-13 06:26:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:18,269 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 501 transitions. [2024-10-13 06:26:18,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 501 transitions. [2024-10-13 06:26:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:26:18,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:18,271 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:18,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:26:18,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1369634149, now seen corresponding path program 1 times [2024-10-13 06:26:18,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:18,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218792224] [2024-10-13 06:26:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218792224] [2024-10-13 06:26:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218792224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:26:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052012852] [2024-10-13 06:26:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:26:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:26:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:19,646 INFO L87 Difference]: Start difference. First operand 344 states and 501 transitions. Second operand has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:20,216 INFO L93 Difference]: Finished difference Result 727 states and 1062 transitions. [2024-10-13 06:26:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:26:20,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-13 06:26:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:20,221 INFO L225 Difference]: With dead ends: 727 [2024-10-13 06:26:20,221 INFO L226 Difference]: Without dead ends: 490 [2024-10-13 06:26:20,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:20,223 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 65 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:20,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 661 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:26:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-13 06:26:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 412. [2024-10-13 06:26:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 382 states have (on average 1.442408376963351) internal successors, (551), 383 states have internal predecessors, (551), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 603 transitions. [2024-10-13 06:26:20,258 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 603 transitions. Word has length 103 [2024-10-13 06:26:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 603 transitions. [2024-10-13 06:26:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 603 transitions. [2024-10-13 06:26:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:26:20,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:20,260 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:20,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:26:20,260 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:20,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash 660206109, now seen corresponding path program 1 times [2024-10-13 06:26:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:20,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263040658] [2024-10-13 06:26:20,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263040658] [2024-10-13 06:26:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263040658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:26:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357359342] [2024-10-13 06:26:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:26:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:21,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:26:21,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:26:21,741 INFO L87 Difference]: Start difference. First operand 412 states and 603 transitions. Second operand has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:22,573 INFO L93 Difference]: Finished difference Result 837 states and 1227 transitions. [2024-10-13 06:26:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:26:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-13 06:26:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:22,576 INFO L225 Difference]: With dead ends: 837 [2024-10-13 06:26:22,576 INFO L226 Difference]: Without dead ends: 563 [2024-10-13 06:26:22,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:26:22,578 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 65 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:22,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 911 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:26:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-10-13 06:26:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 482. [2024-10-13 06:26:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 452 states have (on average 1.4491150442477876) internal successors, (655), 453 states have internal predecessors, (655), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 707 transitions. [2024-10-13 06:26:22,597 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 707 transitions. Word has length 103 [2024-10-13 06:26:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:22,597 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 707 transitions. [2024-10-13 06:26:22,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 707 transitions. [2024-10-13 06:26:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:26:22,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:22,599 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:22,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:26:22,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:22,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash -157442341, now seen corresponding path program 1 times [2024-10-13 06:26:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572927763] [2024-10-13 06:26:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572927763] [2024-10-13 06:26:23,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572927763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:23,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:26:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367646694] [2024-10-13 06:26:23,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:23,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:26:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:26:23,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:26:23,751 INFO L87 Difference]: Start difference. First operand 482 states and 707 transitions. Second operand has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:24,585 INFO L93 Difference]: Finished difference Result 943 states and 1385 transitions. [2024-10-13 06:26:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:26:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-13 06:26:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:24,589 INFO L225 Difference]: With dead ends: 943 [2024-10-13 06:26:24,589 INFO L226 Difference]: Without dead ends: 631 [2024-10-13 06:26:24,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:26:24,591 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 67 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:24,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 876 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:26:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-13 06:26:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 482. [2024-10-13 06:26:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 452 states have (on average 1.4491150442477876) internal successors, (655), 453 states have internal predecessors, (655), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 707 transitions. [2024-10-13 06:26:24,617 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 707 transitions. Word has length 103 [2024-10-13 06:26:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:24,617 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 707 transitions. [2024-10-13 06:26:24,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 707 transitions. [2024-10-13 06:26:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:26:24,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:24,620 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:24,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:26:24,620 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:24,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:24,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1588488867, now seen corresponding path program 1 times [2024-10-13 06:26:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856927674] [2024-10-13 06:26:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:25,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:25,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856927674] [2024-10-13 06:26:25,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856927674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:25,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:26:25,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325302353] [2024-10-13 06:26:25,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:25,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:26:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:25,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:26:25,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:25,976 INFO L87 Difference]: Start difference. First operand 482 states and 707 transitions. Second operand has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:26:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:26,936 INFO L93 Difference]: Finished difference Result 887 states and 1294 transitions. [2024-10-13 06:26:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:26:26,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2024-10-13 06:26:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:26,940 INFO L225 Difference]: With dead ends: 887 [2024-10-13 06:26:26,940 INFO L226 Difference]: Without dead ends: 567 [2024-10-13 06:26:26,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:26,942 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 78 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:26,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 759 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:26:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-13 06:26:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 469. [2024-10-13 06:26:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 438 states have (on average 1.4429223744292237) internal successors, (632), 439 states have internal predecessors, (632), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 684 transitions. [2024-10-13 06:26:26,966 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 684 transitions. Word has length 103 [2024-10-13 06:26:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:26,966 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 684 transitions. [2024-10-13 06:26:26,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 7.666666666666667) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:26:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 684 transitions. [2024-10-13 06:26:26,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:26:26,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:26,968 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:26,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:26:26,968 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:26,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1398658412, now seen corresponding path program 1 times [2024-10-13 06:26:26,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:26,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175074148] [2024-10-13 06:26:26,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:26,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:28,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:28,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175074148] [2024-10-13 06:26:28,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175074148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:28,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:28,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:26:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203110560] [2024-10-13 06:26:28,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:28,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:26:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:26:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:26:28,219 INFO L87 Difference]: Start difference. First operand 469 states and 684 transitions. Second operand has 10 states, 7 states have (on average 6.714285714285714) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:26:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:28,914 INFO L93 Difference]: Finished difference Result 877 states and 1271 transitions. [2024-10-13 06:26:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:26:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.714285714285714) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2024-10-13 06:26:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:28,917 INFO L225 Difference]: With dead ends: 877 [2024-10-13 06:26:28,917 INFO L226 Difference]: Without dead ends: 574 [2024-10-13 06:26:28,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:26:28,918 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 127 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:28,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 790 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:26:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-13 06:26:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 479. [2024-10-13 06:26:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 448 states have (on average 1.4375) internal successors, (644), 449 states have internal predecessors, (644), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 696 transitions. [2024-10-13 06:26:28,937 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 696 transitions. Word has length 104 [2024-10-13 06:26:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:28,938 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 696 transitions. [2024-10-13 06:26:28,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.714285714285714) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:26:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 696 transitions. [2024-10-13 06:26:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:26:28,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:28,940 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:28,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:26:28,940 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:28,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1225732122, now seen corresponding path program 1 times [2024-10-13 06:26:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111386965] [2024-10-13 06:26:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:29,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111386965] [2024-10-13 06:26:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111386965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:29,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:26:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478083931] [2024-10-13 06:26:29,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:29,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:26:29,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:26:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:29,777 INFO L87 Difference]: Start difference. First operand 479 states and 696 transitions. Second operand has 11 states, 7 states have (on average 6.714285714285714) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-13 06:26:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:31,001 INFO L93 Difference]: Finished difference Result 882 states and 1275 transitions. [2024-10-13 06:26:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:26:31,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 6.714285714285714) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 104 [2024-10-13 06:26:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:31,004 INFO L225 Difference]: With dead ends: 882 [2024-10-13 06:26:31,004 INFO L226 Difference]: Without dead ends: 569 [2024-10-13 06:26:31,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:26:31,005 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 197 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:31,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1029 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:26:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-13 06:26:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 523. [2024-10-13 06:26:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 486 states have (on average 1.4238683127572016) internal successors, (692), 488 states have internal predecessors, (692), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:26:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 752 transitions. [2024-10-13 06:26:31,027 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 752 transitions. Word has length 104 [2024-10-13 06:26:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:31,027 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 752 transitions. [2024-10-13 06:26:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 6.714285714285714) internal successors, (47), 11 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-13 06:26:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 752 transitions. [2024-10-13 06:26:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:26:31,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:31,029 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:31,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:26:31,029 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2113030879, now seen corresponding path program 1 times [2024-10-13 06:26:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689780429] [2024-10-13 06:26:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:32,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689780429] [2024-10-13 06:26:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689780429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:32,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:32,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:26:32,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824659690] [2024-10-13 06:26:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:32,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:26:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:26:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:26:32,041 INFO L87 Difference]: Start difference. First operand 523 states and 752 transitions. Second operand has 9 states, 6 states have (on average 8.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:26:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:32,684 INFO L93 Difference]: Finished difference Result 1044 states and 1500 transitions. [2024-10-13 06:26:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:26:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 8.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2024-10-13 06:26:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:32,688 INFO L225 Difference]: With dead ends: 1044 [2024-10-13 06:26:32,688 INFO L226 Difference]: Without dead ends: 683 [2024-10-13 06:26:32,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:32,690 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 77 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:32,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 817 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:26:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-13 06:26:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 568. [2024-10-13 06:26:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 531 states have (on average 1.4256120527306968) internal successors, (757), 533 states have internal predecessors, (757), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:26:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 817 transitions. [2024-10-13 06:26:32,724 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 817 transitions. Word has length 105 [2024-10-13 06:26:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:32,725 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 817 transitions. [2024-10-13 06:26:32,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 8.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:26:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 817 transitions. [2024-10-13 06:26:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:26:32,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:32,727 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:32,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:26:32,727 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:32,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:32,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1894176161, now seen corresponding path program 1 times [2024-10-13 06:26:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:32,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513243147] [2024-10-13 06:26:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:26:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:26:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:26:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:26:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:26:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:26:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:26:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:26:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:26:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:26:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:26:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:26:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:26:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513243147] [2024-10-13 06:26:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513243147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:33,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:26:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949898807] [2024-10-13 06:26:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:33,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:26:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:26:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:26:33,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:26:33,973 INFO L87 Difference]: Start difference. First operand 568 states and 817 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:35,143 INFO L93 Difference]: Finished difference Result 1205 states and 1720 transitions. [2024-10-13 06:26:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:26:35,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-13 06:26:35,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:35,149 INFO L225 Difference]: With dead ends: 1205 [2024-10-13 06:26:35,149 INFO L226 Difference]: Without dead ends: 825 [2024-10-13 06:26:35,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:26:35,152 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 92 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:35,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1474 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:26:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-13 06:26:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 806. [2024-10-13 06:26:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 753 states have (on average 1.409030544488712) internal successors, (1061), 758 states have internal predecessors, (1061), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:26:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1145 transitions. [2024-10-13 06:26:35,190 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1145 transitions. Word has length 105 [2024-10-13 06:26:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:35,190 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1145 transitions. [2024-10-13 06:26:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1145 transitions. [2024-10-13 06:26:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:26:35,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:35,191 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:35,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:26:35,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:35,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash -296396031, now seen corresponding path program 1 times [2024-10-13 06:26:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:26:35,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413245024] [2024-10-13 06:26:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:26:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:26:35,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776878829] [2024-10-13 06:26:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:35,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:26:35,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:26:35,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:26:35,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:26:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:26:35,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:26:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:26:35,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:26:35,705 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:26:35,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:26:35,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 06:26:35,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-13 06:26:35,915 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:26:35,971 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:26:35,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:26:35 BoogieIcfgContainer [2024-10-13 06:26:35,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:26:35,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:26:35,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:26:35,975 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:26:35,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:26:04" (3/4) ... [2024-10-13 06:26:35,977 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:26:35,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:26:35,979 INFO L158 Benchmark]: Toolchain (without parser) took 32591.59ms. Allocated memory was 243.3MB in the beginning and 956.3MB in the end (delta: 713.0MB). Free memory was 171.7MB in the beginning and 535.5MB in the end (delta: -363.8MB). Peak memory consumption was 350.7MB. Max. memory is 16.1GB. [2024-10-13 06:26:35,979 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:26:35,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.95ms. Allocated memory is still 243.3MB. Free memory was 171.7MB in the beginning and 154.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 06:26:35,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.67ms. Allocated memory is still 243.3MB. Free memory was 154.3MB in the beginning and 149.5MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 06:26:35,979 INFO L158 Benchmark]: Boogie Preprocessor took 85.34ms. Allocated memory is still 243.3MB. Free memory was 149.5MB in the beginning and 144.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:26:35,980 INFO L158 Benchmark]: RCFGBuilder took 821.56ms. Allocated memory is still 243.3MB. Free memory was 144.2MB in the beginning and 183.0MB in the end (delta: -38.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-10-13 06:26:35,980 INFO L158 Benchmark]: TraceAbstraction took 31060.29ms. Allocated memory was 243.3MB in the beginning and 956.3MB in the end (delta: 713.0MB). Free memory was 181.9MB in the beginning and 535.5MB in the end (delta: -353.6MB). Peak memory consumption was 359.4MB. Max. memory is 16.1GB. [2024-10-13 06:26:35,980 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 956.3MB. Free memory is still 535.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:26:35,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.95ms. Allocated memory is still 243.3MB. Free memory was 171.7MB in the beginning and 154.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.67ms. Allocated memory is still 243.3MB. Free memory was 154.3MB in the beginning and 149.5MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.34ms. Allocated memory is still 243.3MB. Free memory was 149.5MB in the beginning and 144.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 821.56ms. Allocated memory is still 243.3MB. Free memory was 144.2MB in the beginning and 183.0MB in the end (delta: -38.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 31060.29ms. Allocated memory was 243.3MB in the beginning and 956.3MB in the end (delta: 713.0MB). Free memory was 181.9MB in the beginning and 535.5MB in the end (delta: -353.6MB). Peak memory consumption was 359.4MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 956.3MB. Free memory is still 535.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L47] unsigned short int last_1_WrapperStruct00_var_1_1 = 10; [L48] unsigned short int last_1_WrapperStruct00_var_1_9 = 8; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR WrapperStruct00.var_1_1 [L100] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L101] EXPR WrapperStruct00.var_1_9 [L101] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L79] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L80] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L82] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L83] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L88] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ushort() [L89] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L112] RET updateVariables() [L113] CALL step() [L52] COND TRUE last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR WrapperStruct00.var_1_6 [L53] EXPR WrapperStruct00.var_1_7 [L53] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) [L53] EXPR WrapperStruct00.var_1_8 [L53] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L53] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))) [L55] EXPR WrapperStruct00.var_1_10 [L55] WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L55] WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) [L55] EXPR WrapperStruct00.var_1_6 [L55] EXPR WrapperStruct00.var_1_8 [L55] WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L55] COND FALSE !(WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) [L66] EXPR WrapperStruct00.var_1_6 [L66] WrapperStruct00.var_1_9 = WrapperStruct00.var_1_6 [L68] EXPR WrapperStruct00.var_1_7 [L68] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L68] COND FALSE !(WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) [L75] EXPR WrapperStruct00.var_1_12 [L75] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_12 [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1 [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_7 [L104] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR ((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6))) [L104] EXPR WrapperStruct00.var_1_10 [L104] EXPR WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)) [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR (WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) [L104] EXPR WrapperStruct00.var_1_7 [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_12 [L104] EXPR (WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104-L105] return (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_5) > ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8))))) ? (WrapperStruct00.var_1_5) : ((((((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) > (WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_8)))))))) : 1) && ((WrapperStruct00.var_1_10 || (WrapperStruct00.var_1_6 == WrapperStruct00.var_1_8)) ? ((WrapperStruct00.var_1_6 <= (((((0) < (WrapperStruct00.var_1_1)) ? (0) : (WrapperStruct00.var_1_1))) << WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_10 && (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_6 * WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_9 == ((unsigned short int) 2))) : (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_6)))) && ((WrapperStruct00.var_1_7 != WrapperStruct00.var_1_6) ? ((WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((float) ((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1221 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1192 mSDsluCounter, 11846 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9266 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9981 IncrementalHoareTripleChecker+Invalid, 10100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 2580 mSDtfsCounter, 9981 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 709 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806occurred in iteration=19, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 1034 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 2221 NumberOfCodeBlocks, 2221 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1890 ConstructedInterpolants, 0 QuantifiedInterpolants, 6894 SizeOfPredicates, 2 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 5016/5016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:26:36,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:26:40,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:26:40,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:26:40,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:26:40,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:26:40,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:26:40,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:26:40,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:26:40,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:26:40,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:26:40,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:26:40,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:26:40,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:26:40,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:26:40,335 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:26:40,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:26:40,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:26:40,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:26:40,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:26:40,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:26:40,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:26:40,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:26:40,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:26:40,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:26:40,343 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:26:40,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:26:40,344 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:26:40,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:26:40,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:26:40,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:26:40,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:26:40,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:26:40,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:26:40,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:26:40,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:26:40,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:26:40,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:26:40,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:26:40,348 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:26:40,348 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:26:40,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:26:40,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:26:40,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:26:40,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:26:40,350 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:26:40,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 899138639ae829427fdc22a56c52d3f08a657fba3fbc5df29e57dfd933e1433e [2024-10-13 06:26:40,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:26:40,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:26:40,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:26:40,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:26:40,774 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:26:40,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-10-13 06:26:42,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:26:42,822 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:26:42,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i [2024-10-13 06:26:42,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490df5375/6721cf169705471db0f5ed554b7a9768/FLAGf0b2bbaeb [2024-10-13 06:26:42,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490df5375/6721cf169705471db0f5ed554b7a9768 [2024-10-13 06:26:42,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:26:42,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:26:42,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:26:42,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:26:42,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:26:42,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:26:42" (1/1) ... [2024-10-13 06:26:42,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e0ebed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:42, skipping insertion in model container [2024-10-13 06:26:42,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:26:42" (1/1) ... [2024-10-13 06:26:42,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:26:43,132 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-10-13 06:26:43,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:26:43,202 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:26:43,215 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-2.i[915,928] [2024-10-13 06:26:43,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:26:43,267 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:26:43,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43 WrapperNode [2024-10-13 06:26:43,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:26:43,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:26:43,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:26:43,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:26:43,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,338 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2024-10-13 06:26:43,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:26:43,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:26:43,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:26:43,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:26:43,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,397 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 15 writes are split as follows [0, 15]. [2024-10-13 06:26:43,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:26:43,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:26:43,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:26:43,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:26:43,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (1/1) ... [2024-10-13 06:26:43,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:26:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:26:43,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:26:43,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:26:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:26:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:26:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:26:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:26:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:26:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:26:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:26:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:26:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:26:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:26:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:26:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:26:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:26:43,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:26:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:26:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:26:43,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:26:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:26:43,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:26:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:26:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:26:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:26:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:26:43,678 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:26:43,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:26:44,402 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-10-13 06:26:44,402 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:26:44,429 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:26:44,430 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:26:44,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:26:44 BoogieIcfgContainer [2024-10-13 06:26:44,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:26:44,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:26:44,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:26:44,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:26:44,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:26:42" (1/3) ... [2024-10-13 06:26:44,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a919b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:26:44, skipping insertion in model container [2024-10-13 06:26:44,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:26:43" (2/3) ... [2024-10-13 06:26:44,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a919b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:26:44, skipping insertion in model container [2024-10-13 06:26:44,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:26:44" (3/3) ... [2024-10-13 06:26:44,437 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-2.i [2024-10-13 06:26:44,454 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:26:44,454 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:26:44,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:26:44,551 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;@51c022e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:26:44,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:26:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:26:44,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:44,572 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:44,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:44,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1997544847, now seen corresponding path program 1 times [2024-10-13 06:26:44,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:44,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626451571] [2024-10-13 06:26:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:44,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:44,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:44,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:44,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:26:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:44,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:26:44,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-13 06:26:44,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:26:44,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626451571] [2024-10-13 06:26:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626451571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:44,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:44,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:26:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497026797] [2024-10-13 06:26:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:44,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:26:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:26:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:26:44,999 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:45,057 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2024-10-13 06:26:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:26:45,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-13 06:26:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:45,070 INFO L225 Difference]: With dead ends: 183 [2024-10-13 06:26:45,070 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 06:26:45,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:26:45,079 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:45,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 06:26:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 06:26:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-13 06:26:45,140 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 95 [2024-10-13 06:26:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:45,142 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-13 06:26:45,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-13 06:26:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:26:45,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:45,148 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:45,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 06:26:45,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:45,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash -56948125, now seen corresponding path program 1 times [2024-10-13 06:26:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253584034] [2024-10-13 06:26:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:45,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:45,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:45,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:45,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 06:26:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:45,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:26:45,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-13 06:26:45,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:26:45,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253584034] [2024-10-13 06:26:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253584034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:45,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:45,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:26:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814922901] [2024-10-13 06:26:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:45,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:26:45,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:45,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:26:45,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:45,677 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:45,747 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2024-10-13 06:26:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:26:45,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-13 06:26:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:45,750 INFO L225 Difference]: With dead ends: 183 [2024-10-13 06:26:45,750 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 06:26:45,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:45,752 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:45,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 06:26:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 06:26:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:26:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-13 06:26:45,764 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 95 [2024-10-13 06:26:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:45,765 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-13 06:26:45,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:26:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-13 06:26:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 06:26:45,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:45,769 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:45,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:26:45,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:45,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash 15438433, now seen corresponding path program 1 times [2024-10-13 06:26:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731222978] [2024-10-13 06:26:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:45,979 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:45,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 06:26:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:46,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:26:46,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:46,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:46,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2024-10-13 06:26:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:46,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:26:46,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731222978] [2024-10-13 06:26:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731222978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:46,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:46,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:26:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247982552] [2024-10-13 06:26:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:46,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:26:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:26:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:26:46,835 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:47,361 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2024-10-13 06:26:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:26:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-13 06:26:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:47,364 INFO L225 Difference]: With dead ends: 278 [2024-10-13 06:26:47,364 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 06:26:47,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:26:47,366 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:47,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 297 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:26:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 06:26:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 155. [2024-10-13 06:26:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:26:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-13 06:26:47,401 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 95 [2024-10-13 06:26:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:47,402 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-13 06:26:47,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-13 06:26:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:26:47,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:47,404 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:47,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 06:26:47,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:47,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2122814218, now seen corresponding path program 1 times [2024-10-13 06:26:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368728032] [2024-10-13 06:26:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:47,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:47,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:47,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:26:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:47,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 06:26:47,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:47,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:26:47,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368728032] [2024-10-13 06:26:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368728032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:26:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771469856] [2024-10-13 06:26:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:47,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:26:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:26:47,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:47,847 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:47,882 INFO L93 Difference]: Finished difference Result 256 states and 380 transitions. [2024-10-13 06:26:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:26:47,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-13 06:26:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:47,885 INFO L225 Difference]: With dead ends: 256 [2024-10-13 06:26:47,885 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 06:26:47,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:26:47,887 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:47,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:26:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 06:26:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-13 06:26:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:26:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2024-10-13 06:26:47,900 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 101 [2024-10-13 06:26:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:47,901 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2024-10-13 06:26:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2024-10-13 06:26:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:26:47,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:47,903 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:47,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:26:48,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:48,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:48,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1101745864, now seen corresponding path program 1 times [2024-10-13 06:26:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614886744] [2024-10-13 06:26:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:48,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:48,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:48,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:26:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:48,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 06:26:48,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:48,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:26:49,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 06:26:49,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:49,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-13 06:26:49,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:49,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-10-13 06:26:49,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:49,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-10-13 06:26:50,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:50,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-10-13 06:26:50,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:50,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 68 [2024-10-13 06:26:50,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:50,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 77 [2024-10-13 06:26:50,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:50,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 87 [2024-10-13 06:26:50,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:50,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 43 [2024-10-13 06:26:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 187 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 06:26:50,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:26:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:51,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:51,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614886744] [2024-10-13 06:26:51,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614886744] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:26:51,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:26:51,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2024-10-13 06:26:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517563835] [2024-10-13 06:26:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:51,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:26:51,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:26:51,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:26:51,181 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:51,765 INFO L93 Difference]: Finished difference Result 293 states and 428 transitions. [2024-10-13 06:26:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:26:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-13 06:26:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:51,767 INFO L225 Difference]: With dead ends: 293 [2024-10-13 06:26:51,767 INFO L226 Difference]: Without dead ends: 200 [2024-10-13 06:26:51,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:26:51,769 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:51,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 349 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:26:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-13 06:26:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-10-13 06:26:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 167 states have (on average 1.407185628742515) internal successors, (235), 168 states have internal predecessors, (235), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2024-10-13 06:26:51,782 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 101 [2024-10-13 06:26:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2024-10-13 06:26:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2024-10-13 06:26:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:26:51,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:51,783 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:51,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 06:26:51,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:51,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:51,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash 708718854, now seen corresponding path program 1 times [2024-10-13 06:26:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575385278] [2024-10-13 06:26:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:51,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:51,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 06:26:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:52,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 06:26:52,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:52,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:26:52,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 06:26:52,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 06:26:52,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-13 06:26:52,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-13 06:26:52,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:52,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-13 06:26:52,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-13 06:26:52,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:52,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-10-13 06:26:52,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:52,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 70 [2024-10-13 06:26:52,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:52,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 73 [2024-10-13 06:26:52,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:52,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 30 [2024-10-13 06:26:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-13 06:26:52,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:26:52,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575385278] [2024-10-13 06:26:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575385278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:26:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684023676] [2024-10-13 06:26:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:26:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:26:52,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:26:52,790 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:54,489 INFO L93 Difference]: Finished difference Result 518 states and 759 transitions. [2024-10-13 06:26:54,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:26:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2024-10-13 06:26:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:54,499 INFO L225 Difference]: With dead ends: 518 [2024-10-13 06:26:54,499 INFO L226 Difference]: Without dead ends: 387 [2024-10-13 06:26:54,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:26:54,501 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 340 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:54,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 359 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 06:26:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-13 06:26:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 233. [2024-10-13 06:26:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 204 states have internal predecessors, (286), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 338 transitions. [2024-10-13 06:26:54,571 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 338 transitions. Word has length 101 [2024-10-13 06:26:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:54,579 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 338 transitions. [2024-10-13 06:26:54,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:26:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 338 transitions. [2024-10-13 06:26:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:26:54,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:54,581 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:54,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 06:26:54,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:54,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:54,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1504594710, now seen corresponding path program 1 times [2024-10-13 06:26:54,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:54,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102519895] [2024-10-13 06:26:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:54,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:54,786 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:54,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 06:26:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:55,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:26:55,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:55,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:26:55,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 06:26:55,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:55,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-13 06:26:55,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:55,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-13 06:26:55,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:55,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-13 06:26:55,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:55,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:26:56,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:56,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:26:56,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:56,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 70 [2024-10-13 06:26:56,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:56,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 85 [2024-10-13 06:26:57,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:57,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 89 [2024-10-13 06:26:57,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:57,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 46 [2024-10-13 06:26:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 181 proven. 30 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-13 06:26:57,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:26:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:57,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102519895] [2024-10-13 06:26:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102519895] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:26:57,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:26:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2024-10-13 06:26:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889037473] [2024-10-13 06:26:57,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:26:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:26:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:26:57,628 INFO L87 Difference]: Start difference. First operand 233 states and 338 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:26:58,557 INFO L93 Difference]: Finished difference Result 515 states and 753 transitions. [2024-10-13 06:26:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:26:58,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:26:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:26:58,561 INFO L225 Difference]: With dead ends: 515 [2024-10-13 06:26:58,561 INFO L226 Difference]: Without dead ends: 361 [2024-10-13 06:26:58,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:26:58,563 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 181 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:26:58,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 406 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:26:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-13 06:26:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 299. [2024-10-13 06:26:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 269 states have (on average 1.4275092936802973) internal successors, (384), 270 states have internal predecessors, (384), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:26:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 436 transitions. [2024-10-13 06:26:58,586 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 436 transitions. Word has length 103 [2024-10-13 06:26:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:26:58,586 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 436 transitions. [2024-10-13 06:26:58,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:26:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 436 transitions. [2024-10-13 06:26:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:26:58,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:26:58,588 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:26:58,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 06:26:58,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:58,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:26:58,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:26:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2129706892, now seen corresponding path program 1 times [2024-10-13 06:26:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:26:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434450230] [2024-10-13 06:26:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:26:58,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:26:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:26:58,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:26:58,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 06:26:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:59,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:26:59,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:59,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:59,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2024-10-13 06:26:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:26:59,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:26:59,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:26:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434450230] [2024-10-13 06:26:59,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434450230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:26:59,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:26:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:26:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750949364] [2024-10-13 06:26:59,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:26:59,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:26:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:26:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:26:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:26:59,587 INFO L87 Difference]: Start difference. First operand 299 states and 436 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:27:03,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:27:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:07,024 INFO L93 Difference]: Finished difference Result 634 states and 923 transitions. [2024-10-13 06:27:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:27:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:27:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:07,034 INFO L225 Difference]: With dead ends: 634 [2024-10-13 06:27:07,034 INFO L226 Difference]: Without dead ends: 423 [2024-10-13 06:27:07,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:27:07,039 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:07,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 316 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-13 06:27:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-13 06:27:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 336. [2024-10-13 06:27:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 306 states have (on average 1.4411764705882353) internal successors, (441), 307 states have internal predecessors, (441), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:27:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 493 transitions. [2024-10-13 06:27:07,074 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 493 transitions. Word has length 103 [2024-10-13 06:27:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:07,075 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 493 transitions. [2024-10-13 06:27:07,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:27:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 493 transitions. [2024-10-13 06:27:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:27:07,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:07,076 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:27:07,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 06:27:07,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:27:07,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:07,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1312058442, now seen corresponding path program 1 times [2024-10-13 06:27:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:27:07,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908878278] [2024-10-13 06:27:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:27:07,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:27:07,281 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:27:07,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 06:27:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:07,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 06:27:07,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:27:07,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:27:07,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 06:27:07,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:07,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-13 06:27:07,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:07,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-13 06:27:08,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:08,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-13 06:27:08,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:08,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:27:08,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:08,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:27:08,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:08,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 71 [2024-10-13 06:27:08,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:08,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 85 [2024-10-13 06:27:09,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:09,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 89 [2024-10-13 06:27:09,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:09,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 46 [2024-10-13 06:27:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 181 proven. 30 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-13 06:27:09,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:27:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:27:09,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:27:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908878278] [2024-10-13 06:27:09,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908878278] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:27:09,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:27:09,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2024-10-13 06:27:09,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274577656] [2024-10-13 06:27:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:27:09,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:27:09,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:27:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:27:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:27:09,764 INFO L87 Difference]: Start difference. First operand 336 states and 493 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:27:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:27:10,900 INFO L93 Difference]: Finished difference Result 583 states and 856 transitions. [2024-10-13 06:27:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:27:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:27:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:27:10,903 INFO L225 Difference]: With dead ends: 583 [2024-10-13 06:27:10,904 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 06:27:10,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:27:10,905 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 63 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:27:10,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 567 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:27:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 06:27:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 342. [2024-10-13 06:27:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 312 states have (on average 1.435897435897436) internal successors, (448), 313 states have internal predecessors, (448), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:27:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 500 transitions. [2024-10-13 06:27:10,927 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 500 transitions. Word has length 103 [2024-10-13 06:27:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:27:10,928 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 500 transitions. [2024-10-13 06:27:10,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:27:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 500 transitions. [2024-10-13 06:27:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:27:10,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:27:10,930 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:27:10,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 06:27:11,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:27:11,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:27:11,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:27:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1723449428, now seen corresponding path program 1 times [2024-10-13 06:27:11,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:27:11,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341429252] [2024-10-13 06:27:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:27:11,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:27:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:27:11,140 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:27:11,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 06:27:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:27:11,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 06:27:11,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:27:11,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:27:11,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 06:27:11,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:11,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-13 06:27:11,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:11,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-13 06:27:12,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:12,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:27:12,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:12,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-13 06:27:12,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:27:12,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54