./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-83.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-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:32:56,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:32:56,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:32:57,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:32:57,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:32:57,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:32:57,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:32:57,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:32:57,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:32:57,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:32:57,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:32:57,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:32:57,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:32:57,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:32:57,067 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:32:57,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:32:57,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:32:57,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:32:57,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:32:57,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:32:57,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:32:57,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:32:57,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:32:57,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:32:57,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:32:57,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:32:57,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:32:57,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:32:57,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:32:57,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:32:57,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:32:57,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:32:57,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:57,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:32:57,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:32:57,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:32:57,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:32:57,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:32:57,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:32:57,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:32:57,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:32:57,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:32:57,080 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2024-10-13 06:32:57,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:32:57,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:32:57,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:32:57,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:32:57,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:32:57,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-13 06:32:58,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:32:59,266 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:32:59,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-13 06:32:59,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8e81d8c/761f8d3570ba4cccacf52677e1c3ee88/FLAG69b1345be [2024-10-13 06:32:59,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8e81d8c/761f8d3570ba4cccacf52677e1c3ee88 [2024-10-13 06:32:59,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:32:59,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:32:59,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:59,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:32:59,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:32:59,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347b3762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59, skipping insertion in model container [2024-10-13 06:32:59,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:32:59,545 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-83.i[916,929] [2024-10-13 06:32:59,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:59,621 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:32:59,634 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-83.i[916,929] [2024-10-13 06:32:59,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:32:59,693 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:32:59,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59 WrapperNode [2024-10-13 06:32:59,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:32:59,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:59,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:32:59,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:32:59,702 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:32:59" (1/1) ... [2024-10-13 06:32:59,722 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:32:59" (1/1) ... [2024-10-13 06:32:59,775 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-10-13 06:32:59,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:32:59,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:32:59,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:32:59,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:32:59,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,831 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-13 06:32:59,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:32:59,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:32:59,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:32:59,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:32:59,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (1/1) ... [2024-10-13 06:32:59,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:32:59,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:32:59,943 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:32:59,947 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:33:00,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:33:00,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:33:00,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:33:00,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:33:00,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:33:00,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:33:00,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:33:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:33:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:33:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:33:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:33:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:33:00,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:33:00,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:33:00,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:33:00,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:33:00,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:33:00,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:33:00,149 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:33:00,806 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-13 06:33:00,806 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:33:00,851 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:33:00,851 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:33:00,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:00 BoogieIcfgContainer [2024-10-13 06:33:00,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:33:00,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:33:00,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:33:00,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:33:00,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:32:59" (1/3) ... [2024-10-13 06:33:00,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258cfef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:00, skipping insertion in model container [2024-10-13 06:33:00,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:32:59" (2/3) ... [2024-10-13 06:33:00,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258cfef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:00, skipping insertion in model container [2024-10-13 06:33:00,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:00" (3/3) ... [2024-10-13 06:33:00,862 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2024-10-13 06:33:00,881 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:33:00,881 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:33:01,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:33:01,020 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;@6b4e35ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:33:01,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:33:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:01,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:01,048 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:01,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:01,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1677763838, now seen corresponding path program 1 times [2024-10-13 06:33:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:01,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095511384] [2024-10-13 06:33:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:01,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095511384] [2024-10-13 06:33:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095511384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:33:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396698503] [2024-10-13 06:33:01,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:01,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:33:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:33:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:01,490 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:01,557 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-10-13 06:33:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:33:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-13 06:33:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:01,571 INFO L225 Difference]: With dead ends: 207 [2024-10-13 06:33:01,572 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 06:33:01,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:33:01,584 INFO L432 NwaCegarLoop]: 144 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, 144 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:33:01,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 06:33:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 06:33:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-10-13 06:33:01,640 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 101 [2024-10-13 06:33:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:01,641 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-10-13 06:33:01,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-10-13 06:33:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:01,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:01,647 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:01,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:33:01,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:01,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash -3535280, now seen corresponding path program 1 times [2024-10-13 06:33:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:01,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196141278] [2024-10-13 06:33:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196141278] [2024-10-13 06:33:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196141278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:02,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294166475] [2024-10-13 06:33:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:02,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:02,106 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:02,221 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2024-10-13 06:33:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:02,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-13 06:33:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:02,223 INFO L225 Difference]: With dead ends: 207 [2024-10-13 06:33:02,224 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 06:33:02,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:33:02,226 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:02,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 06:33:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 06:33:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-10-13 06:33:02,248 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 101 [2024-10-13 06:33:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-10-13 06:33:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-10-13 06:33:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:02,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:02,254 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:33:02,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:02,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1942697326, now seen corresponding path program 1 times [2024-10-13 06:33:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542823223] [2024-10-13 06:33:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542823223] [2024-10-13 06:33:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542823223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470662078] [2024-10-13 06:33:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:02,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:02,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:02,563 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:02,638 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2024-10-13 06:33:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:33:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:02,643 INFO L225 Difference]: With dead ends: 212 [2024-10-13 06:33:02,646 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 06:33:02,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:33:02,649 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:02,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 06:33:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-13 06:33:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-13 06:33:02,669 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 101 [2024-10-13 06:33:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:02,670 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-13 06:33:02,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-13 06:33:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:02,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:02,675 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:33:02,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:02,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1542923344, now seen corresponding path program 1 times [2024-10-13 06:33:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707701101] [2024-10-13 06:33:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:02,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707701101] [2024-10-13 06:33:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707701101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938764472] [2024-10-13 06:33:02,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:02,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:02,893 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:02,950 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2024-10-13 06:33:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:02,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:33:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:02,953 INFO L225 Difference]: With dead ends: 216 [2024-10-13 06:33:02,953 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 06:33:02,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:33:02,957 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:02,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 06:33:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-13 06:33:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-13 06:33:02,969 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 101 [2024-10-13 06:33:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:02,969 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-13 06:33:02,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-13 06:33:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:02,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:02,971 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:02,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:33:02,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:02,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1600181646, now seen corresponding path program 1 times [2024-10-13 06:33:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710577215] [2024-10-13 06:33:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710577215] [2024-10-13 06:33:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710577215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544171601] [2024-10-13 06:33:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:03,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:03,173 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:03,219 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-10-13 06:33:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:03,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:33:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:03,221 INFO L225 Difference]: With dead ends: 220 [2024-10-13 06:33:03,221 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 06:33:03,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:33:03,223 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:03,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 06:33:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-13 06:33:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-13 06:33:03,241 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 101 [2024-10-13 06:33:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:03,242 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-13 06:33:03,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-13 06:33:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:33:03,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:03,243 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:03,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:33:03,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:03,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1600241228, now seen corresponding path program 1 times [2024-10-13 06:33:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712784266] [2024-10-13 06:33:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712784266] [2024-10-13 06:33:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712784266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:03,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:03,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258143019] [2024-10-13 06:33:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:03,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:03,640 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:03,842 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2024-10-13 06:33:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:03,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:33:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:03,844 INFO L225 Difference]: With dead ends: 221 [2024-10-13 06:33:03,846 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:33:03,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:33:03,847 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 133 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:03,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 141 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:33:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-13 06:33:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-13 06:33:03,865 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 101 [2024-10-13 06:33:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:03,866 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-13 06:33:03,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-13 06:33:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:33:03,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:03,867 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:03,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:33:03,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash -901193252, now seen corresponding path program 1 times [2024-10-13 06:33:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:03,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872602632] [2024-10-13 06:33:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:04,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872602632] [2024-10-13 06:33:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872602632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:04,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:04,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:04,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209063116] [2024-10-13 06:33:04,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:04,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:04,125 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:04,379 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2024-10-13 06:33:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-13 06:33:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:04,381 INFO L225 Difference]: With dead ends: 223 [2024-10-13 06:33:04,381 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 06:33:04,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:04,383 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:04,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 410 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 06:33:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 06:33:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-13 06:33:04,398 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 102 [2024-10-13 06:33:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:04,400 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-13 06:33:04,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-13 06:33:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:04,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:04,401 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:04,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:33:04,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:04,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 402218610, now seen corresponding path program 1 times [2024-10-13 06:33:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:04,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644088125] [2024-10-13 06:33:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644088125] [2024-10-13 06:33:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644088125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:33:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741537846] [2024-10-13 06:33:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:06,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:33:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:33:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:06,061 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:06,660 INFO L93 Difference]: Finished difference Result 304 states and 420 transitions. [2024-10-13 06:33:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:33:06,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-13 06:33:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:06,663 INFO L225 Difference]: With dead ends: 304 [2024-10-13 06:33:06,664 INFO L226 Difference]: Without dead ends: 192 [2024-10-13 06:33:06,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:33:06,666 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 82 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:06,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 627 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:33:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-13 06:33:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-10-13 06:33:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 172 states have internal predecessors, (231), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 261 transitions. [2024-10-13 06:33:06,689 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 261 transitions. Word has length 103 [2024-10-13 06:33:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:06,690 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 261 transitions. [2024-10-13 06:33:06,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 261 transitions. [2024-10-13 06:33:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:06,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:06,692 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:06,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:33:06,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash -877645068, now seen corresponding path program 1 times [2024-10-13 06:33:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499658748] [2024-10-13 06:33:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900334855] [2024-10-13 06:33:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:06,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:06,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:06,792 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:33:06,794 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:33:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:07,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:33:07,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:07,253 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 29 treesize of output 13 [2024-10-13 06:33:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:07,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:07,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:07,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499658748] [2024-10-13 06:33:07,275 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900334855] [2024-10-13 06:33:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900334855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:07,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:07,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32834427] [2024-10-13 06:33:07,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:07,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:07,278 INFO L87 Difference]: Start difference. First operand 189 states and 261 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:07,654 INFO L93 Difference]: Finished difference Result 537 states and 743 transitions. [2024-10-13 06:33:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:33:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:07,658 INFO L225 Difference]: With dead ends: 537 [2024-10-13 06:33:07,658 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 06:33:07,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:07,660 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 110 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:07,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 422 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:33:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 06:33:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 209. [2024-10-13 06:33:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 192 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2024-10-13 06:33:07,680 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 103 [2024-10-13 06:33:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:07,681 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2024-10-13 06:33:07,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2024-10-13 06:33:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:07,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:07,683 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:07,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:07,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:07,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:07,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1898713422, now seen corresponding path program 1 times [2024-10-13 06:33:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:07,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349361041] [2024-10-13 06:33:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146368211] [2024-10-13 06:33:07,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:07,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:07,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:07,984 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:33:07,986 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:33:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:08,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 06:33:08,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:08,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:08,230 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 38 treesize of output 40 [2024-10-13 06:33:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:08,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349361041] [2024-10-13 06:33:08,317 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146368211] [2024-10-13 06:33:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146368211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616827599] [2024-10-13 06:33:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:08,319 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:08,889 INFO L93 Difference]: Finished difference Result 557 states and 775 transitions. [2024-10-13 06:33:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:33:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:08,892 INFO L225 Difference]: With dead ends: 557 [2024-10-13 06:33:08,892 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 06:33:08,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:08,893 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 214 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:08,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 307 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:33:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 06:33:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 213. [2024-10-13 06:33:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.3641025641025641) internal successors, (266), 196 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 296 transitions. [2024-10-13 06:33:08,909 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 296 transitions. Word has length 103 [2024-10-13 06:33:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:08,910 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 296 transitions. [2024-10-13 06:33:08,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 296 transitions. [2024-10-13 06:33:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:08,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:08,912 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:08,931 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:33:09,113 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,SelfDestructingSolverStorable9 [2024-10-13 06:33:09,114 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash -487259373, now seen corresponding path program 1 times [2024-10-13 06:33:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935667115] [2024-10-13 06:33:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935667115] [2024-10-13 06:33:09,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935667115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:09,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644593982] [2024-10-13 06:33:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:09,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:09,532 INFO L87 Difference]: Start difference. First operand 213 states and 296 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-13 06:33:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:09,837 INFO L93 Difference]: Finished difference Result 425 states and 591 transitions. [2024-10-13 06:33:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:09,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-10-13 06:33:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:09,840 INFO L225 Difference]: With dead ends: 425 [2024-10-13 06:33:09,840 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 06:33:09,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:09,841 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 216 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:09,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 186 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:33:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 06:33:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-13 06:33:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.353846153846154) internal successors, (264), 196 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 06:33:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2024-10-13 06:33:09,854 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 103 [2024-10-13 06:33:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:09,854 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2024-10-13 06:33:09,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-13 06:33:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2024-10-13 06:33:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:09,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:09,855 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:33:09,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1304378290, now seen corresponding path program 1 times [2024-10-13 06:33:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862973728] [2024-10-13 06:33:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622616388] [2024-10-13 06:33:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:09,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:09,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:09,959 INFO L229 MonitoredProcess]: Starting monitored process 4 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:33:09,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 06:33:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:33:10,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:10,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:10,270 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 27 treesize of output 29 [2024-10-13 06:33:10,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:10,350 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 32 treesize of output 10 [2024-10-13 06:33:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:10,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:10,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862973728] [2024-10-13 06:33:10,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622616388] [2024-10-13 06:33:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622616388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380940827] [2024-10-13 06:33:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:10,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:10,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:10,428 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:11,673 INFO L93 Difference]: Finished difference Result 602 states and 827 transitions. [2024-10-13 06:33:11,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:11,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:33:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:11,677 INFO L225 Difference]: With dead ends: 602 [2024-10-13 06:33:11,677 INFO L226 Difference]: Without dead ends: 390 [2024-10-13 06:33:11,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:11,679 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 202 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:11,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 746 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:33:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-13 06:33:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 385. [2024-10-13 06:33:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 349 states have (on average 1.346704871060172) internal successors, (470), 352 states have internal predecessors, (470), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:33:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 530 transitions. [2024-10-13 06:33:11,718 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 530 transitions. Word has length 103 [2024-10-13 06:33:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:11,719 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 530 transitions. [2024-10-13 06:33:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 530 transitions. [2024-10-13 06:33:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:11,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:11,721 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:11,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:11,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:11,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:11,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1886780784, now seen corresponding path program 1 times [2024-10-13 06:33:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:11,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261901303] [2024-10-13 06:33:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:33:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261901303] [2024-10-13 06:33:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261901303] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:33:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959954578] [2024-10-13 06:33:13,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:13,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:13,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:13,627 INFO L229 MonitoredProcess]: Starting monitored process 5 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:33:13,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 06:33:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 06:33:14,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:14,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-13 06:33:14,264 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 15 treesize of output 1 [2024-10-13 06:33:14,293 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 15 treesize of output 1 [2024-10-13 06:33:14,324 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 15 treesize of output 1 [2024-10-13 06:33:14,344 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 15 treesize of output 1 [2024-10-13 06:33:14,360 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 15 treesize of output 1 [2024-10-13 06:33:14,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-10-13 06:33:14,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:14,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2024-10-13 06:33:14,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:14,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-13 06:33:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:14,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:14,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959954578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:33:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2024-10-13 06:33:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349769786] [2024-10-13 06:33:14,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:14,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:33:14,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:14,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:33:14,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:33:14,923 INFO L87 Difference]: Start difference. First operand 385 states and 530 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:15,774 INFO L93 Difference]: Finished difference Result 797 states and 1097 transitions. [2024-10-13 06:33:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:33:15,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:33:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:15,780 INFO L225 Difference]: With dead ends: 797 [2024-10-13 06:33:15,780 INFO L226 Difference]: Without dead ends: 413 [2024-10-13 06:33:15,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:33:15,782 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 183 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:15,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 348 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:33:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-13 06:33:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 386. [2024-10-13 06:33:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 350 states have (on average 1.3457142857142856) internal successors, (471), 353 states have internal predecessors, (471), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:33:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 531 transitions. [2024-10-13 06:33:15,820 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 531 transitions. Word has length 103 [2024-10-13 06:33:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:15,821 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 531 transitions. [2024-10-13 06:33:15,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 531 transitions. [2024-10-13 06:33:15,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:33:15,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:15,823 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:15,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:16,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:16,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:16,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash 794905200, now seen corresponding path program 1 times [2024-10-13 06:33:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:16,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549586484] [2024-10-13 06:33:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:33:17,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549586484] [2024-10-13 06:33:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549586484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:33:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789137814] [2024-10-13 06:33:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:17,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:17,600 INFO L229 MonitoredProcess]: Starting monitored process 6 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:33:17,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 06:33:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 06:33:18,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:18,145 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 15 treesize of output 1 [2024-10-13 06:33:18,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:33:18,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:33:18,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:33:18,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 14 [2024-10-13 06:33:18,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:18,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-10-13 06:33:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 118 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 06:33:18,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:33:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-13 06:33:19,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789137814] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:33:19,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:33:19,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 25 [2024-10-13 06:33:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30648320] [2024-10-13 06:33:19,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:33:19,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 06:33:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:19,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 06:33:19,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=516, Unknown=6, NotChecked=0, Total=600 [2024-10-13 06:33:19,130 INFO L87 Difference]: Start difference. First operand 386 states and 531 transitions. Second operand has 25 states, 21 states have (on average 5.619047619047619) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (30), 5 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-13 06:33:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:21,429 INFO L93 Difference]: Finished difference Result 815 states and 1099 transitions. [2024-10-13 06:33:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 06:33:21,431 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 5.619047619047619) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (30), 5 states have call predecessors, (30), 9 states have call successors, (30) Word has length 103 [2024-10-13 06:33:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:21,434 INFO L225 Difference]: With dead ends: 815 [2024-10-13 06:33:21,434 INFO L226 Difference]: Without dead ends: 430 [2024-10-13 06:33:21,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=285, Invalid=1431, Unknown=6, NotChecked=0, Total=1722 [2024-10-13 06:33:21,439 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 587 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:21,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 951 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 06:33:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-13 06:33:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 345. [2024-10-13 06:33:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 312 states have (on average 1.3365384615384615) internal successors, (417), 314 states have internal predecessors, (417), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:33:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 465 transitions. [2024-10-13 06:33:21,473 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 465 transitions. Word has length 103 [2024-10-13 06:33:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:21,477 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 465 transitions. [2024-10-13 06:33:21,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 5.619047619047619) internal successors, (118), 25 states have internal predecessors, (118), 9 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (30), 5 states have call predecessors, (30), 9 states have call successors, (30) [2024-10-13 06:33:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2024-10-13 06:33:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:33:21,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:21,478 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:21,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 06:33:21,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 06:33:21,680 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -79816511, now seen corresponding path program 1 times [2024-10-13 06:33:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:21,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087642598] [2024-10-13 06:33:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [134850128] [2024-10-13 06:33:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:21,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:21,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:21,774 INFO L229 MonitoredProcess]: Starting monitored process 7 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:33:21,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 06:33:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:22,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:33:22,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:22,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:22,153 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 29 treesize of output 31 [2024-10-13 06:33:22,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:22,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 51 treesize of output 19 [2024-10-13 06:33:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:22,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:22,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087642598] [2024-10-13 06:33:22,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:22,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134850128] [2024-10-13 06:33:22,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134850128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:22,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:22,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:22,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328485499] [2024-10-13 06:33:22,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:22,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:22,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:22,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:22,518 INFO L87 Difference]: Start difference. First operand 345 states and 465 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:23,684 INFO L93 Difference]: Finished difference Result 752 states and 1007 transitions. [2024-10-13 06:33:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:23,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-13 06:33:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:23,687 INFO L225 Difference]: With dead ends: 752 [2024-10-13 06:33:23,688 INFO L226 Difference]: Without dead ends: 408 [2024-10-13 06:33:23,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:23,692 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 201 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:23,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 789 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:33:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-13 06:33:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2024-10-13 06:33:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 312 states have (on average 1.3333333333333333) internal successors, (416), 314 states have internal predecessors, (416), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:33:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 464 transitions. [2024-10-13 06:33:23,723 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 464 transitions. Word has length 104 [2024-10-13 06:33:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:23,723 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 464 transitions. [2024-10-13 06:33:23,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 464 transitions. [2024-10-13 06:33:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:33:23,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:23,725 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:23,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 06:33:23,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 06:33:23,931 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:23,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash 690574077, now seen corresponding path program 1 times [2024-10-13 06:33:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998617816] [2024-10-13 06:33:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025855199] [2024-10-13 06:33:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:23,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:23,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:23,999 INFO L229 MonitoredProcess]: Starting monitored process 8 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:33:24,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 06:33:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 06:33:24,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:24,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:24,280 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 36 [2024-10-13 06:33:24,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:24,312 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 36 treesize of output 14 [2024-10-13 06:33:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:24,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:24,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998617816] [2024-10-13 06:33:24,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025855199] [2024-10-13 06:33:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025855199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966692393] [2024-10-13 06:33:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:24,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:24,331 INFO L87 Difference]: Start difference. First operand 345 states and 464 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:24,742 INFO L93 Difference]: Finished difference Result 866 states and 1165 transitions. [2024-10-13 06:33:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:24,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-13 06:33:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:24,745 INFO L225 Difference]: With dead ends: 866 [2024-10-13 06:33:24,746 INFO L226 Difference]: Without dead ends: 522 [2024-10-13 06:33:24,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:24,749 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 68 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:24,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 470 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:33:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-10-13 06:33:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 360. [2024-10-13 06:33:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 329 states have internal predecessors, (438), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:33:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 486 transitions. [2024-10-13 06:33:24,782 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 486 transitions. Word has length 104 [2024-10-13 06:33:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:24,783 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 486 transitions. [2024-10-13 06:33:24,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 486 transitions. [2024-10-13 06:33:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:33:24,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:24,786 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:24,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 06:33:24,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:24,987 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:24,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash -330494277, now seen corresponding path program 1 times [2024-10-13 06:33:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:24,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268910953] [2024-10-13 06:33:24,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094720985] [2024-10-13 06:33:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:25,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:25,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:25,078 INFO L229 MonitoredProcess]: Starting monitored process 9 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:33:25,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 06:33:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:25,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 06:33:25,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:25,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-13 06:33:25,391 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:33:25,419 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:33:25,433 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:33:25,451 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:33:25,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-10-13 06:33:25,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:25,620 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 65 [2024-10-13 06:33:25,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:25,798 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 90 treesize of output 68 [2024-10-13 06:33:25,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:25,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 89 treesize of output 31 [2024-10-13 06:33:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:25,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268910953] [2024-10-13 06:33:25,927 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094720985] [2024-10-13 06:33:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094720985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:25,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:33:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028161354] [2024-10-13 06:33:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:25,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:33:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:33:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:33:25,929 INFO L87 Difference]: Start difference. First operand 360 states and 486 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:27,170 INFO L93 Difference]: Finished difference Result 1068 states and 1447 transitions. [2024-10-13 06:33:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:33:27,171 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-13 06:33:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:27,175 INFO L225 Difference]: With dead ends: 1068 [2024-10-13 06:33:27,175 INFO L226 Difference]: Without dead ends: 709 [2024-10-13 06:33:27,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:33:27,177 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 252 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:27,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 802 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:33:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-10-13 06:33:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 435. [2024-10-13 06:33:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 388 states have (on average 1.3350515463917525) internal successors, (518), 390 states have internal predecessors, (518), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 588 transitions. [2024-10-13 06:33:27,213 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 588 transitions. Word has length 104 [2024-10-13 06:33:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:27,213 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 588 transitions. [2024-10-13 06:33:27,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 588 transitions. [2024-10-13 06:33:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:33:27,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:27,215 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:27,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:27,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 06:33:27,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:27,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1610357955, now seen corresponding path program 1 times [2024-10-13 06:33:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000808468] [2024-10-13 06:33:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000808468] [2024-10-13 06:33:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000808468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 06:33:28,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731377254] [2024-10-13 06:33:28,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:28,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:33:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:33:28,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:33:28,795 INFO L87 Difference]: Start difference. First operand 435 states and 588 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-13 06:33:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:30,296 INFO L93 Difference]: Finished difference Result 906 states and 1218 transitions. [2024-10-13 06:33:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 06:33:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2024-10-13 06:33:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:30,299 INFO L225 Difference]: With dead ends: 906 [2024-10-13 06:33:30,300 INFO L226 Difference]: Without dead ends: 547 [2024-10-13 06:33:30,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2024-10-13 06:33:30,302 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 396 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:30,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1294 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 06:33:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-13 06:33:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 435. [2024-10-13 06:33:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 388 states have (on average 1.3350515463917525) internal successors, (518), 390 states have internal predecessors, (518), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 588 transitions. [2024-10-13 06:33:30,342 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 588 transitions. Word has length 104 [2024-10-13 06:33:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:30,342 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 588 transitions. [2024-10-13 06:33:30,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-13 06:33:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 588 transitions. [2024-10-13 06:33:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:33:30,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:30,344 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:30,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:33:30,344 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:30,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash -163701519, now seen corresponding path program 1 times [2024-10-13 06:33:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:30,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699985902] [2024-10-13 06:33:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:30,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363798545] [2024-10-13 06:33:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:30,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:30,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:30,406 INFO L229 MonitoredProcess]: Starting monitored process 10 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:33:30,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 06:33:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 06:33:30,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:30,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-13 06:33:30,775 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:33:30,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-10-13 06:33:30,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:30,891 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 64 treesize of output 60 [2024-10-13 06:33:31,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:31,068 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 79 treesize of output 63 [2024-10-13 06:33:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:31,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699985902] [2024-10-13 06:33:31,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363798545] [2024-10-13 06:33:31,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363798545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:31,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:33:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983934109] [2024-10-13 06:33:31,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:31,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:33:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:33:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:31,237 INFO L87 Difference]: Start difference. First operand 435 states and 588 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:32,226 INFO L93 Difference]: Finished difference Result 1072 states and 1451 transitions. [2024-10-13 06:33:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:33:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:33:32,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:32,233 INFO L225 Difference]: With dead ends: 1072 [2024-10-13 06:33:32,233 INFO L226 Difference]: Without dead ends: 713 [2024-10-13 06:33:32,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:33:32,236 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 250 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:32,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 658 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:33:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-13 06:33:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 453. [2024-10-13 06:33:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 406 states have (on average 1.3349753694581281) internal successors, (542), 408 states have internal predecessors, (542), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 612 transitions. [2024-10-13 06:33:32,276 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 612 transitions. Word has length 105 [2024-10-13 06:33:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:32,276 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 612 transitions. [2024-10-13 06:33:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 612 transitions. [2024-10-13 06:33:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:33:32,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:32,278 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:32,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 06:33:32,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:32,482 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:32,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1184769873, now seen corresponding path program 1 times [2024-10-13 06:33:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900039830] [2024-10-13 06:33:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724022681] [2024-10-13 06:33:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:32,548 INFO L229 MonitoredProcess]: Starting monitored process 11 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:33:32,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 06:33:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-13 06:33:32,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:32,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-13 06:33:32,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:33:33,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:33:33,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 06:33:33,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 14 [2024-10-13 06:33:33,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:33,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2024-10-13 06:33:33,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:33,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2024-10-13 06:33:33,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:33,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2024-10-13 06:33:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 118 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 06:33:33,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:33:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900039830] [2024-10-13 06:33:33,523 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724022681] [2024-10-13 06:33:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724022681] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 06:33:33,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:33:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-13 06:33:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341285713] [2024-10-13 06:33:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:33:33,525 INFO L87 Difference]: Start difference. First operand 453 states and 612 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:33,815 INFO L93 Difference]: Finished difference Result 814 states and 1098 transitions. [2024-10-13 06:33:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:33:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:33,822 INFO L225 Difference]: With dead ends: 814 [2024-10-13 06:33:33,823 INFO L226 Difference]: Without dead ends: 452 [2024-10-13 06:33:33,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:33:33,826 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 62 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:33,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 427 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-13 06:33:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 427. [2024-10-13 06:33:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 382 states have internal predecessors, (502), 35 states have call successors, (35), 11 states have call predecessors, (35), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 572 transitions. [2024-10-13 06:33:33,868 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 572 transitions. Word has length 105 [2024-10-13 06:33:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:33,869 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 572 transitions. [2024-10-13 06:33:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 572 transitions. [2024-10-13 06:33:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:33:33,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:33,870 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:33,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:34,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:34,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:34,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1792601743, now seen corresponding path program 1 times [2024-10-13 06:33:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400788001] [2024-10-13 06:33:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:34,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187676747] [2024-10-13 06:33:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:34,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:34,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:34,125 INFO L229 MonitoredProcess]: Starting monitored process 12 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:33:34,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 06:33:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:34,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-13 06:33:34,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:34,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 06:33:34,501 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 15 treesize of output 1 [2024-10-13 06:33:34,545 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 15 treesize of output 1 [2024-10-13 06:33:34,571 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 15 treesize of output 1 [2024-10-13 06:33:34,594 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 15 treesize of output 1 [2024-10-13 06:33:34,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2024-10-13 06:33:34,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 52 [2024-10-13 06:33:34,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:34,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 55 [2024-10-13 06:33:35,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:35,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 31 [2024-10-13 06:33:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:35,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400788001] [2024-10-13 06:33:35,060 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187676747] [2024-10-13 06:33:35,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187676747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:35,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:35,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:33:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400723316] [2024-10-13 06:33:35,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:35,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:33:35,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:33:35,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:35,062 INFO L87 Difference]: Start difference. First operand 427 states and 572 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:36,143 INFO L93 Difference]: Finished difference Result 1069 states and 1436 transitions. [2024-10-13 06:33:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:33:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:33:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:36,148 INFO L225 Difference]: With dead ends: 1069 [2024-10-13 06:33:36,148 INFO L226 Difference]: Without dead ends: 711 [2024-10-13 06:33:36,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:33:36,151 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 180 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:36,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 644 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:33:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-13 06:33:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 449. [2024-10-13 06:33:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 401 states have (on average 1.319201995012469) internal successors, (529), 403 states have internal predecessors, (529), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 599 transitions. [2024-10-13 06:33:36,193 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 599 transitions. Word has length 105 [2024-10-13 06:33:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:36,193 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 599 transitions. [2024-10-13 06:33:36,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 599 transitions. [2024-10-13 06:33:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:33:36,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:36,195 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:36,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 06:33:36,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 06:33:36,396 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:36,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1409264556, now seen corresponding path program 1 times [2024-10-13 06:33:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:36,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752206597] [2024-10-13 06:33:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:36,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752206597] [2024-10-13 06:33:36,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752206597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:36,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:36,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59074632] [2024-10-13 06:33:36,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:36,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:36,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:36,796 INFO L87 Difference]: Start difference. First operand 449 states and 599 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:37,231 INFO L93 Difference]: Finished difference Result 957 states and 1278 transitions. [2024-10-13 06:33:37,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:33:37,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-13 06:33:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:37,237 INFO L225 Difference]: With dead ends: 957 [2024-10-13 06:33:37,237 INFO L226 Difference]: Without dead ends: 599 [2024-10-13 06:33:37,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:37,239 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 103 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:37,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 534 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:33:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-10-13 06:33:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 482. [2024-10-13 06:33:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 434 states have (on average 1.3133640552995391) internal successors, (570), 436 states have internal predecessors, (570), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 640 transitions. [2024-10-13 06:33:37,274 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 640 transitions. Word has length 105 [2024-10-13 06:33:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:37,275 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 640 transitions. [2024-10-13 06:33:37,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 640 transitions. [2024-10-13 06:33:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:33:37,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:37,276 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:37,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:33:37,277 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1944836350, now seen corresponding path program 1 times [2024-10-13 06:33:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282844399] [2024-10-13 06:33:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:37,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:37,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282844399] [2024-10-13 06:33:37,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282844399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:37,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:37,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:33:37,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963897307] [2024-10-13 06:33:37,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:37,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:33:37,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:37,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:33:37,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:33:37,356 INFO L87 Difference]: Start difference. First operand 482 states and 640 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:37,400 INFO L93 Difference]: Finished difference Result 863 states and 1152 transitions. [2024-10-13 06:33:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:33:37,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:33:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:37,403 INFO L225 Difference]: With dead ends: 863 [2024-10-13 06:33:37,403 INFO L226 Difference]: Without dead ends: 472 [2024-10-13 06:33:37,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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:33:37,408 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:37,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-13 06:33:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-10-13 06:33:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 424 states have (on average 1.3089622641509433) internal successors, (555), 426 states have internal predecessors, (555), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 625 transitions. [2024-10-13 06:33:37,440 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 625 transitions. Word has length 105 [2024-10-13 06:33:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:37,440 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 625 transitions. [2024-10-13 06:33:37,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 625 transitions. [2024-10-13 06:33:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:33:37,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:37,442 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:37,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:33:37,442 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2028240427, now seen corresponding path program 1 times [2024-10-13 06:33:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201177758] [2024-10-13 06:33:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:33:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:38,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201177758] [2024-10-13 06:33:38,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201177758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:38,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:38,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618194912] [2024-10-13 06:33:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:38,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:38,018 INFO L87 Difference]: Start difference. First operand 472 states and 625 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:38,306 INFO L93 Difference]: Finished difference Result 878 states and 1169 transitions. [2024-10-13 06:33:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:38,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-13 06:33:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:38,309 INFO L225 Difference]: With dead ends: 878 [2024-10-13 06:33:38,309 INFO L226 Difference]: Without dead ends: 491 [2024-10-13 06:33:38,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:38,311 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 118 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:38,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 340 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-13 06:33:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 454. [2024-10-13 06:33:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 406 states have (on average 1.293103448275862) internal successors, (525), 408 states have internal predecessors, (525), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 06:33:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 595 transitions. [2024-10-13 06:33:38,346 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 595 transitions. Word has length 105 [2024-10-13 06:33:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:38,347 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 595 transitions. [2024-10-13 06:33:38,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 595 transitions. [2024-10-13 06:33:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:33:38,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:38,348 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:38,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:33:38,348 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:38,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash -141069265, now seen corresponding path program 1 times [2024-10-13 06:33:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:38,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414921486] [2024-10-13 06:33:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:38,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:38,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122333338] [2024-10-13 06:33:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:38,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:38,404 INFO L229 MonitoredProcess]: Starting monitored process 13 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:33:38,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 06:33:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 06:33:38,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:38,711 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:33:38,717 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 41 treesize of output 19 [2024-10-13 06:33:38,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:38,762 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 53 treesize of output 52 [2024-10-13 06:33:38,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:38,863 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 68 treesize of output 55 [2024-10-13 06:33:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:38,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:38,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:38,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414921486] [2024-10-13 06:33:38,926 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:33:38,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122333338] [2024-10-13 06:33:38,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122333338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:38,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:38,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475203107] [2024-10-13 06:33:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:38,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:38,928 INFO L87 Difference]: Start difference. First operand 454 states and 595 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:39,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:39,330 INFO L93 Difference]: Finished difference Result 858 states and 1125 transitions. [2024-10-13 06:33:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-13 06:33:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:39,334 INFO L225 Difference]: With dead ends: 858 [2024-10-13 06:33:39,334 INFO L226 Difference]: Without dead ends: 495 [2024-10-13 06:33:39,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:39,335 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 172 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:39,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 414 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:33:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-13 06:33:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 446. [2024-10-13 06:33:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 399 states have (on average 1.2882205513784462) internal successors, (514), 401 states have internal predecessors, (514), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 06:33:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 580 transitions. [2024-10-13 06:33:39,373 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 580 transitions. Word has length 105 [2024-10-13 06:33:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:39,377 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 580 transitions. [2024-10-13 06:33:39,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 580 transitions. [2024-10-13 06:33:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:33:39,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:39,379 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:39,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 06:33:39,580 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1478767653, now seen corresponding path program 1 times [2024-10-13 06:33:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:39,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530810413] [2024-10-13 06:33:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:39,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:33:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284896160] [2024-10-13 06:33:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:39,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:33:39,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:39,639 INFO L229 MonitoredProcess]: Starting monitored process 14 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:33:39,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 06:33:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:33:39,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:33:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:33:40,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:33:40,185 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:33:40,186 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:33:40,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 06:33:40,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-13 06:33:40,393 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, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:40,462 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:33:40,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:33:40 BoogieIcfgContainer [2024-10-13 06:33:40,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:33:40,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:33:40,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:33:40,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:33:40,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:00" (3/4) ... [2024-10-13 06:33:40,470 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:33:40,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:33:40,474 INFO L158 Benchmark]: Toolchain (without parser) took 41168.83ms. Allocated memory was 165.7MB in the beginning and 450.9MB in the end (delta: 285.2MB). Free memory was 115.5MB in the beginning and 157.8MB in the end (delta: -42.4MB). Peak memory consumption was 245.4MB. Max. memory is 16.1GB. [2024-10-13 06:33:40,474 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:33:40,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.28ms. Allocated memory is still 165.7MB. Free memory was 115.1MB in the beginning and 97.7MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 06:33:40,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.57ms. Allocated memory is still 165.7MB. Free memory was 97.7MB in the beginning and 92.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:33:40,475 INFO L158 Benchmark]: Boogie Preprocessor took 121.70ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 87.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:33:40,475 INFO L158 Benchmark]: RCFGBuilder took 953.68ms. Allocated memory is still 165.7MB. Free memory was 87.3MB in the beginning and 49.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 06:33:40,476 INFO L158 Benchmark]: TraceAbstraction took 39610.84ms. Allocated memory was 165.7MB in the beginning and 450.9MB in the end (delta: 285.2MB). Free memory was 48.8MB in the beginning and 158.9MB in the end (delta: -110.1MB). Peak memory consumption was 178.3MB. Max. memory is 16.1GB. [2024-10-13 06:33:40,476 INFO L158 Benchmark]: Witness Printer took 7.80ms. Allocated memory is still 450.9MB. Free memory was 158.9MB in the beginning and 157.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:33:40,477 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.13ms. Allocated memory is still 165.7MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.28ms. Allocated memory is still 165.7MB. Free memory was 115.1MB in the beginning and 97.7MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.57ms. Allocated memory is still 165.7MB. Free memory was 97.7MB in the beginning and 92.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.70ms. Allocated memory is still 165.7MB. Free memory was 92.8MB in the beginning and 87.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 953.68ms. Allocated memory is still 165.7MB. Free memory was 87.3MB in the beginning and 49.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 39610.84ms. Allocated memory was 165.7MB in the beginning and 450.9MB in the end (delta: 285.2MB). Free memory was 48.8MB in the beginning and 158.9MB in the end (delta: -110.1MB). Peak memory consumption was 178.3MB. Max. memory is 16.1GB. * Witness Printer took 7.80ms. Allocated memory is still 450.9MB. Free memory was 158.9MB in the beginning and 157.8MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 106, overapproximation of bitwiseOr at line 69. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 128, 0, 25, 4, 127.625, 0.8, 128.75, 24.8, -128, 64, 5, 1.5 }; [L51] unsigned short int last_1_WrapperStruct00_var_1_1 = 128; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] EXPR WrapperStruct00.var_1_1 [L103] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L84] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L87] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L94] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_10 [L95] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L96] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_11 [L97] EXPR WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR (WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] EXPR (WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L98] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L114] RET updateVariables() [L115] CALL step() [L55] WrapperStruct00.var_1_14 = 200 [L56] EXPR WrapperStruct00.var_1_16 [L56] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L57] EXPR WrapperStruct00.var_1_10 [L57] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_10 [L58] EXPR WrapperStruct00.var_1_3 [L58] EXPR WrapperStruct00.var_1_4 [L58] signed long int stepLocal_0 = WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4; [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L62] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) [L62] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_0=0] [L62] COND TRUE stepLocal_0 >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)))) [L63] EXPR WrapperStruct00.var_1_4 [L63] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_3 [L68] EXPR WrapperStruct00.var_1_1 [L68] signed long int stepLocal_2 = WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1; [L69] EXPR WrapperStruct00.var_1_14 [L69] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L69] EXPR WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128, stepLocal_2=3] [L69] signed long int stepLocal_1 = WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15; [L70] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L70] COND FALSE !(WrapperStruct00.var_1_15 <= stepLocal_2) [L77] EXPR WrapperStruct00.var_1_10 [L77] WrapperStruct00.var_1_8 = WrapperStruct00.var_1_10 [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L79] COND FALSE !(WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) [L106] EXPR (((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR WrapperStruct00.var_1_4 [L106] EXPR ((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) [L106] EXPR WrapperStruct00.var_1_15 [L106] EXPR WrapperStruct00.var_1_3 [L106] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) [L106] EXPR WrapperStruct00.var_1_8 [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR (WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L106-L107] return (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) < 0 ) ? -((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))) : ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))))) : (((WrapperStruct00.var_1_3 / WrapperStruct00.var_1_4) >= (((((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) < ((~ last_1_WrapperStruct00_var_1_1))) ? ((last_1_WrapperStruct00_var_1_1 * WrapperStruct00.var_1_15)) : ((~ last_1_WrapperStruct00_var_1_1))))) ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_3)))) && ((WrapperStruct00.var_1_15 <= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_1)) ? ((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_14 ^ WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_8 == ((double) (((((WrapperStruct00.var_1_10) < 0 ) ? -(WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_10))) + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_8 == ((double) WrapperStruct00.var_1_10)))) && ((WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((double) ((((WrapperStruct00.var_1_11) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : 1)) && (WrapperStruct00.var_1_14 == ((signed short int) 200))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_17 == ((double) WrapperStruct00.var_1_10)) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.4s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3539 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3535 mSDsluCounter, 12600 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9354 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10968 IncrementalHoareTripleChecker+Invalid, 11429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 3246 mSDtfsCounter, 10968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1777 SyntacticMatches, 2 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=22, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 1760 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 4039 NumberOfCodeBlocks, 4039 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2965 ConstructedInterpolants, 15 QuantifiedInterpolants, 15489 SizeOfPredicates, 63 NumberOfNonLiveVariables, 4268 ConjunctsInSsa, 312 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 6302/6380 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:33:40,623 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-83.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 e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:33:42,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:33:42,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:33:42,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:33:42,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:33:42,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:33:42,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:33:42,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:33:42,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:33:42,987 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:33:42,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:33:42,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:33:42,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:33:42,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:33:42,989 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:33:42,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:33:42,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:33:42,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:33:42,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:33:42,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:33:42,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:33:42,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:33:42,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:33:42,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:33:42,997 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:33:42,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:33:43,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:33:43,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:33:43,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:33:43,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:33:43,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:33:43,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:33:43,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:33:43,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:33:43,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:43,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:33:43,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:33:43,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:33:43,004 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:33:43,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:33:43,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:33:43,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:33:43,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:33:43,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:33:43,005 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:33:43,005 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 -> e012c3f089ce2459bf8c485ba1c0fe1abfe61f524338fc8aecd21133749baa09 [2024-10-13 06:33:43,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:33:43,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:33:43,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:33:43,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:33:43,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:33:43,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-13 06:33:45,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:33:45,288 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:33:45,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-83.i [2024-10-13 06:33:45,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54b3ff8c/ce216747aa124271afc51fb70e787cba/FLAGfe727494d [2024-10-13 06:33:45,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54b3ff8c/ce216747aa124271afc51fb70e787cba [2024-10-13 06:33:45,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:33:45,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:33:45,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:45,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:33:45,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:33:45,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e94d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45, skipping insertion in model container [2024-10-13 06:33:45,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:33:45,547 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-83.i[916,929] [2024-10-13 06:33:45,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:45,646 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:33:45,657 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-83.i[916,929] [2024-10-13 06:33:45,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:45,768 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:33:45,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45 WrapperNode [2024-10-13 06:33:45,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:45,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:45,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:33:45,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:33:45,777 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:33:45" (1/1) ... [2024-10-13 06:33:45,804 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:33:45" (1/1) ... [2024-10-13 06:33:45,856 INFO L138 Inliner]: procedures = 33, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-10-13 06:33:45,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:45,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:33:45,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:33:45,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:33:45,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,918 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-13 06:33:45,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:33:45,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:33:45,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:33:45,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:33:45,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (1/1) ... [2024-10-13 06:33:45,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:46,007 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:33:46,014 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:33:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:33:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:33:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:33:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:33:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:33:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:33:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:33:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:33:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:33:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:33:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:33:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:33:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:33:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:33:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:33:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:33:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:33:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:33:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:33:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:33:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:33:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:33:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:33:46,227 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:33:46,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:33:47,258 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-13 06:33:47,259 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:33:47,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:33:47,313 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:33:47,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:47 BoogieIcfgContainer [2024-10-13 06:33:47,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:33:47,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:33:47,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:33:47,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:33:47,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:33:45" (1/3) ... [2024-10-13 06:33:47,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26761ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:47, skipping insertion in model container [2024-10-13 06:33:47,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:45" (2/3) ... [2024-10-13 06:33:47,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26761ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:47, skipping insertion in model container [2024-10-13 06:33:47,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:47" (3/3) ... [2024-10-13 06:33:47,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-83.i [2024-10-13 06:33:47,343 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:33:47,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:33:47,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:33:47,424 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;@639afcdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:33:47,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:33:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:47,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:47,447 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:47,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:47,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1157573802, now seen corresponding path program 1 times [2024-10-13 06:33:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089120782] [2024-10-13 06:33:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:47,472 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:33:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:47,476 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:33:47,477 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:33:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:33:47,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-13 06:33:47,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:47,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089120782] [2024-10-13 06:33:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089120782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:47,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:33:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989396007] [2024-10-13 06:33:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:47,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:33:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:33:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:47,937 INFO L87 Difference]: Start difference. First operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:48,004 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2024-10-13 06:33:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:33:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-13 06:33:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:48,014 INFO L225 Difference]: With dead ends: 189 [2024-10-13 06:33:48,014 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 06:33:48,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:33:48,021 INFO L432 NwaCegarLoop]: 129 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, 129 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:33:48,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 06:33:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 06:33:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-10-13 06:33:48,068 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 99 [2024-10-13 06:33:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:48,069 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-10-13 06:33:48,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-10-13 06:33:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:48,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:48,073 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,084 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:33:48,274 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:33:48,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:48,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:48,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1482080892, now seen corresponding path program 1 times [2024-10-13 06:33:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558344035] [2024-10-13 06:33:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:48,277 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:33:48,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:48,281 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:33:48,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 (3)] Waiting until timeout for monitored process [2024-10-13 06:33:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:48,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:33:48,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 06:33:48,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:48,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558344035] [2024-10-13 06:33:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558344035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:48,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:48,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577605777] [2024-10-13 06:33:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:48,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:48,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:48,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:48,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:48,669 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:48,813 INFO L93 Difference]: Finished difference Result 189 states and 268 transitions. [2024-10-13 06:33:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-13 06:33:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:48,815 INFO L225 Difference]: With dead ends: 189 [2024-10-13 06:33:48,816 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 06:33:48,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 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:33:48,818 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:48,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 06:33:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 06:33:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-13 06:33:48,830 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 99 [2024-10-13 06:33:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:48,832 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-13 06:33:48,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:33:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-13 06:33:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:48,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:48,839 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,858 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:33:49,039 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:33:49,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash -446191810, now seen corresponding path program 1 times [2024-10-13 06:33:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:49,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332300697] [2024-10-13 06:33:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:49,044 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:33:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:49,048 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:33:49,049 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:33:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:33:49,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:49,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:49,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332300697] [2024-10-13 06:33:49,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332300697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509601340] [2024-10-13 06:33:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:49,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:49,457 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:49,578 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2024-10-13 06:33:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:49,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-13 06:33:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:49,583 INFO L225 Difference]: With dead ends: 196 [2024-10-13 06:33:49,584 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 06:33:49,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:49,589 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:49,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 486 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 06:33:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-13 06:33:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2024-10-13 06:33:49,602 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 99 [2024-10-13 06:33:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:49,602 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2024-10-13 06:33:49,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2024-10-13 06:33:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:49,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:49,605 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,615 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:33:49,805 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:33:49,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:49,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1255538436, now seen corresponding path program 1 times [2024-10-13 06:33:49,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:49,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945199188] [2024-10-13 06:33:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:49,808 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:33:49,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:49,813 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:33:49,816 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:33:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:33:50,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:50,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:50,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945199188] [2024-10-13 06:33:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945199188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:50,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014780099] [2024-10-13 06:33:50,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:50,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:50,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:50,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:50,208 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:50,340 INFO L93 Difference]: Finished difference Result 202 states and 281 transitions. [2024-10-13 06:33:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:50,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-13 06:33:50,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:50,342 INFO L225 Difference]: With dead ends: 202 [2024-10-13 06:33:50,343 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 06:33:50,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:50,344 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:50,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 598 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 06:33:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-10-13 06:33:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2024-10-13 06:33:50,360 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 99 [2024-10-13 06:33:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:50,365 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2024-10-13 06:33:50,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2024-10-13 06:33:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:50,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:50,367 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:50,381 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 06:33:50,571 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:33:50,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:50,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1198280134, now seen corresponding path program 1 times [2024-10-13 06:33:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:50,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134467277] [2024-10-13 06:33:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:50,573 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:33:50,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:50,575 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:33:50,577 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:33:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:33:50,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:50,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:50,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134467277] [2024-10-13 06:33:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134467277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021797905] [2024-10-13 06:33:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:50,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:50,943 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:51,098 INFO L93 Difference]: Finished difference Result 206 states and 285 transitions. [2024-10-13 06:33:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-13 06:33:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:51,106 INFO L225 Difference]: With dead ends: 206 [2024-10-13 06:33:51,107 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 06:33:51,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:51,108 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:51,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 712 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:33:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 06:33:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-13 06:33:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:33:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-10-13 06:33:51,123 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 99 [2024-10-13 06:33:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:51,124 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-10-13 06:33:51,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-10-13 06:33:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:51,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:51,128 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:51,142 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 (6)] Ended with exit code 0 [2024-10-13 06:33:51,329 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:33:51,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:51,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1198220552, now seen corresponding path program 1 times [2024-10-13 06:33:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571083479] [2024-10-13 06:33:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:51,331 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:33:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:51,334 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:33:51,336 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:33:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:51,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:33:51,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:51,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-10-13 06:33:52,083 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:33:52,135 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 36 treesize of output 24 [2024-10-13 06:33:52,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:52,167 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 50 treesize of output 28 [2024-10-13 06:33:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:52,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:52,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571083479] [2024-10-13 06:33:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571083479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:52,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493281325] [2024-10-13 06:33:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:52,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:52,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:52,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:52,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:52,246 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:54,934 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2024-10-13 06:33:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:33:54,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-13 06:33:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:54,940 INFO L225 Difference]: With dead ends: 405 [2024-10-13 06:33:54,940 INFO L226 Difference]: Without dead ends: 302 [2024-10-13 06:33:54,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:33:54,942 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 239 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:54,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 661 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 06:33:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-13 06:33:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 148. [2024-10-13 06:33:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 123 states have internal predecessors, (162), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 06:33:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 206 transitions. [2024-10-13 06:33:54,960 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 206 transitions. Word has length 99 [2024-10-13 06:33:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:54,961 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 206 transitions. [2024-10-13 06:33:54,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 206 transitions. [2024-10-13 06:33:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:54,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:54,963 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:54,980 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:33:55,163 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:33:55,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:55,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:55,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1332234058, now seen corresponding path program 1 times [2024-10-13 06:33:55,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:55,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865794765] [2024-10-13 06:33:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:55,166 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:33:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:55,167 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:33:55,169 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:33:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:33:55,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:55,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-10-13 06:33:55,835 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:33:55,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:55,906 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 59 treesize of output 38 [2024-10-13 06:33:55,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:33:55,999 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 39 treesize of output 17 [2024-10-13 06:33:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:33:56,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:33:56,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:33:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865794765] [2024-10-13 06:33:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865794765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:56,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:56,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065750237] [2024-10-13 06:33:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:33:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:56,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:56,101 INFO L87 Difference]: Start difference. First operand 148 states and 206 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:59,158 INFO L93 Difference]: Finished difference Result 364 states and 498 transitions. [2024-10-13 06:33:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:59,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-13 06:33:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:59,161 INFO L225 Difference]: With dead ends: 364 [2024-10-13 06:33:59,161 INFO L226 Difference]: Without dead ends: 261 [2024-10-13 06:33:59,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:59,163 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 223 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:59,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 377 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 06:33:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-13 06:33:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 165. [2024-10-13 06:33:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.3214285714285714) internal successors, (185), 140 states have internal predecessors, (185), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 06:33:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 229 transitions. [2024-10-13 06:33:59,194 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 229 transitions. Word has length 99 [2024-10-13 06:33:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:59,194 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 229 transitions. [2024-10-13 06:33:59,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:33:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 229 transitions. [2024-10-13 06:33:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:33:59,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:59,196 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:59,215 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:33:59,399 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:33:59,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:59,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1941664884, now seen corresponding path program 1 times [2024-10-13 06:33:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:33:59,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507307837] [2024-10-13 06:33:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:59,401 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:33:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:33:59,402 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:33:59,403 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:33:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:59,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 06:33:59,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:33:59,853 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:33:59,907 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 33 treesize of output 36 [2024-10-13 06:34:03,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:34:03,594 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 53 treesize of output 62