./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:11:54,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:11:54,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 07:11:54,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:11:54,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:11:54,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:11:54,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:11:54,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:11:54,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:11:54,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:11:54,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:11:54,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:11:54,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:11:54,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:11:54,460 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:11:54,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:11:54,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:11:54,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:11:54,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:11:54,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:11:54,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:11:54,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:11:54,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:11:54,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:11:54,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:11:54,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:11:54,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:11:54,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:11:54,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:11:54,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:11:54,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:11:54,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:11:54,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:11:54,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:11:54,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:11:54,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:11:54,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:11:54,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:11:54,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:11:54,470 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2024-10-14 07:11:54,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:11:54,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:11:54,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:11:54,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:11:54,792 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:11:54,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2024-10-14 07:11:56,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:11:56,477 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:11:56,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2024-10-14 07:11:56,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057689927/2f5e8363c74545d68aa670183dd50f20/FLAG2c6dfaab5 [2024-10-14 07:11:56,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057689927/2f5e8363c74545d68aa670183dd50f20 [2024-10-14 07:11:56,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:11:56,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:11:56,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:11:56,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:11:56,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:11:56,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:11:56" (1/1) ... [2024-10-14 07:11:56,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49009dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:56, skipping insertion in model container [2024-10-14 07:11:56,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:11:56" (1/1) ... [2024-10-14 07:11:56,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:11:57,035 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2024-10-14 07:11:57,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:11:57,083 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:11:57,092 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2024-10-14 07:11:57,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:11:57,135 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:11:57,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57 WrapperNode [2024-10-14 07:11:57,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:11:57,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:11:57,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:11:57,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:11:57,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,191 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2024-10-14 07:11:57,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:11:57,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:11:57,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:11:57,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:11:57,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:11:57,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:11:57,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:11:57,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:11:57,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:11:57,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (1/1) ... [2024-10-14 07:11:57,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:11:57,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:11:57,314 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-14 07:11:57,317 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-14 07:11:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:11:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:11:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:11:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:11:57,470 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:11:57,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:11:57,770 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-10-14 07:11:57,770 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:11:57,809 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:11:57,813 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:11:57,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:57 BoogieIcfgContainer [2024-10-14 07:11:57,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:11:57,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:11:57,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:11:57,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:11:57,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:11:56" (1/3) ... [2024-10-14 07:11:57,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511757ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:11:57, skipping insertion in model container [2024-10-14 07:11:57,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:57" (2/3) ... [2024-10-14 07:11:57,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511757ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:11:57, skipping insertion in model container [2024-10-14 07:11:57,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:57" (3/3) ... [2024-10-14 07:11:57,826 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2024-10-14 07:11:57,845 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:11:57,845 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:11:57,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:11:57,914 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;@4f616c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:11:57,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:11:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 07:11:57,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:11:57,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:11:57,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:11:57,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:11:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -578766290, now seen corresponding path program 1 times [2024-10-14 07:11:57,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:11:57,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463702253] [2024-10-14 07:11:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:11:57,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:11:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:11:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:11:58,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:11:58,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463702253] [2024-10-14 07:11:58,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463702253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:11:58,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:11:58,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:11:58,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696415127] [2024-10-14 07:11:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:11:58,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:11:58,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:11:58,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:11:58,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:11:58,521 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:11:58,563 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2024-10-14 07:11:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:11:58,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 07:11:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:11:58,574 INFO L225 Difference]: With dead ends: 58 [2024-10-14 07:11:58,574 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 07:11:58,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-14 07:11:58,581 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:11:58,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:11:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 07:11:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 07:11:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-10-14 07:11:58,611 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 14 [2024-10-14 07:11:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:11:58,611 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-10-14 07:11:58,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2024-10-14 07:11:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 07:11:58,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:11:58,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:11:58,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:11:58,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:11:58,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:11:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash -760190588, now seen corresponding path program 1 times [2024-10-14 07:11:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:11:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012016630] [2024-10-14 07:11:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:11:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:11:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:11:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:11:58,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:11:58,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012016630] [2024-10-14 07:11:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012016630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:11:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:11:58,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:11:58,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282252850] [2024-10-14 07:11:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:11:58,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:11:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:11:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:11:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:11:58,727 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:11:58,757 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2024-10-14 07:11:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:11:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 07:11:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:11:58,760 INFO L225 Difference]: With dead ends: 61 [2024-10-14 07:11:58,760 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 07:11:58,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-14 07:11:58,762 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:11:58,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:11:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 07:11:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 07:11:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-10-14 07:11:58,772 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 15 [2024-10-14 07:11:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:11:58,772 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-14 07:11:58,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-10-14 07:11:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 07:11:58,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:11:58,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:11:58,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:11:58,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:11:58,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:11:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1105929671, now seen corresponding path program 1 times [2024-10-14 07:11:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:11:58,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172978015] [2024-10-14 07:11:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:11:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:11:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:11:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:11:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:11:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172978015] [2024-10-14 07:11:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172978015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:11:59,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:11:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:11:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749329461] [2024-10-14 07:11:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:11:59,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:11:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:11:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:11:59,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:11:59,191 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:11:59,314 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2024-10-14 07:11:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:11:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 07:11:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:11:59,321 INFO L225 Difference]: With dead ends: 88 [2024-10-14 07:11:59,321 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 07:11:59,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:11:59,323 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 101 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:11:59,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 133 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:11:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 07:11:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 40. [2024-10-14 07:11:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-10-14 07:11:59,331 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 16 [2024-10-14 07:11:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:11:59,331 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-10-14 07:11:59,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-10-14 07:11:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 07:11:59,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:11:59,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:11:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:11:59,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:11:59,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:11:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 832968299, now seen corresponding path program 1 times [2024-10-14 07:11:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:11:59,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666217619] [2024-10-14 07:11:59,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:11:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:11:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:11:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:11:59,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:11:59,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666217619] [2024-10-14 07:11:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666217619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:11:59,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:11:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:11:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112673630] [2024-10-14 07:11:59,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:11:59,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:11:59,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:11:59,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:11:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:11:59,679 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:11:59,839 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2024-10-14 07:11:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:11:59,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 07:11:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:11:59,840 INFO L225 Difference]: With dead ends: 90 [2024-10-14 07:11:59,841 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 07:11:59,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:11:59,842 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 104 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:11:59,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 188 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:11:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 07:11:59,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2024-10-14 07:11:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2024-10-14 07:11:59,854 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 17 [2024-10-14 07:11:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:11:59,856 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2024-10-14 07:11:59,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:11:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2024-10-14 07:11:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 07:11:59,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:11:59,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:11:59,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:11:59,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:11:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:11:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash 371559844, now seen corresponding path program 1 times [2024-10-14 07:11:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:11:59,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869500581] [2024-10-14 07:11:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:11:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:11:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:12:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869500581] [2024-10-14 07:12:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869500581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:00,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:00,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:12:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752148887] [2024-10-14 07:12:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:00,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:12:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:12:00,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:12:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:12:00,467 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:00,697 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2024-10-14 07:12:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:12:00,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 07:12:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:00,699 INFO L225 Difference]: With dead ends: 90 [2024-10-14 07:12:00,699 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 07:12:00,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:12:00,700 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 99 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:00,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 170 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 07:12:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2024-10-14 07:12:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-10-14 07:12:00,712 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 18 [2024-10-14 07:12:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:00,713 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-10-14 07:12:00,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-10-14 07:12:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 07:12:00,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:00,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:12:00,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:12:00,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 197998442, now seen corresponding path program 1 times [2024-10-14 07:12:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:12:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137452664] [2024-10-14 07:12:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:12:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:12:00,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:12:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:12:00,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:12:00,807 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:12:00,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:12:00,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:12:00,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 07:12:00,854 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:12:00,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:12:00 BoogieIcfgContainer [2024-10-14 07:12:00,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:12:00,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:12:00,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:12:00,862 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:12:00,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:57" (3/4) ... [2024-10-14 07:12:00,865 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:12:00,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:12:00,866 INFO L158 Benchmark]: Toolchain (without parser) took 4016.12ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 131.2MB in the beginning and 106.1MB in the end (delta: 25.1MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2024-10-14 07:12:00,867 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:12:00,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.43ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 117.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 07:12:00,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.46ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 114.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:12:00,867 INFO L158 Benchmark]: Boogie Preprocessor took 77.06ms. Allocated memory is still 184.5MB. Free memory was 113.7MB in the beginning and 110.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:12:00,868 INFO L158 Benchmark]: RCFGBuilder took 540.05ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 88.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 07:12:00,868 INFO L158 Benchmark]: TraceAbstraction took 3044.15ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 87.9MB in the beginning and 107.2MB in the end (delta: -19.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2024-10-14 07:12:00,869 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 239.1MB. Free memory was 107.2MB in the beginning and 106.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:12:00,871 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.19ms. Allocated memory is still 184.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.43ms. Allocated memory is still 184.5MB. Free memory was 131.2MB in the beginning and 117.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.46ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 114.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.06ms. Allocated memory is still 184.5MB. Free memory was 113.7MB in the beginning and 110.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 540.05ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 88.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3044.15ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 87.9MB in the beginning and 107.2MB in the end (delta: -19.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * Witness Printer took 4.87ms. Allocated memory is still 239.1MB. Free memory was 107.2MB in the beginning and 106.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 21]: 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 bitwiseOr at line 98, overapproximation of bitwiseAnd at line 103. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 2); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (2 - 1); [L38] const SORT_35 mask_SORT_35 = (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 12); [L39] const SORT_35 msb_SORT_35 = (SORT_35)1 << (12 - 1); [L41] const SORT_6 var_7 = 0; [L42] const SORT_12 var_14 = 0; [L43] const SORT_1 var_19 = 1; [L44] const SORT_6 var_49 = 1; [L45] const SORT_6 var_51 = 4; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_3 input_23; [L51] SORT_3 input_25; [L52] SORT_3 input_27; [L53] SORT_1 input_29; [L54] SORT_3 input_31; [L55] SORT_3 input_33; [L56] SORT_35 input_36; [L57] SORT_35 input_38; [L58] SORT_3 input_40; [L59] SORT_3 input_42; [L60] SORT_3 input_44; [L61] SORT_3 input_46; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_6 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L63] SORT_6 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_6; [L65] SORT_6 init_9_arg_1 = var_7; [L66] state_8 = init_9_arg_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L69] input_2 = __VERIFIER_nondet_uchar() [L70] input_4 = __VERIFIER_nondet_ushort() [L71] input_5 = __VERIFIER_nondet_ushort() [L72] input_23 = __VERIFIER_nondet_ushort() [L73] input_25 = __VERIFIER_nondet_ushort() [L74] input_27 = __VERIFIER_nondet_ushort() [L75] input_29 = __VERIFIER_nondet_uchar() [L76] input_31 = __VERIFIER_nondet_ushort() [L77] input_33 = __VERIFIER_nondet_ushort() [L78] input_36 = __VERIFIER_nondet_ushort() [L79] input_38 = __VERIFIER_nondet_ushort() [L80] input_40 = __VERIFIER_nondet_ushort() [L81] input_42 = __VERIFIER_nondet_ushort() [L82] input_44 = __VERIFIER_nondet_ushort() [L83] input_46 = __VERIFIER_nondet_ushort() [L86] SORT_6 var_10_arg_0 = state_8; [L87] SORT_1 var_10 = var_10_arg_0 >> 2; [L88] SORT_1 var_11_arg_0 = var_10; [L89] SORT_1 var_11 = ~var_11_arg_0; [L90] SORT_6 var_13_arg_0 = state_8; [L91] SORT_12 var_13 = var_13_arg_0 >> 0; VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_11=-1, var_13=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] EXPR var_13 & mask_SORT_12 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_11=-1, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] var_13 = var_13 & mask_SORT_12 [L93] SORT_12 var_15_arg_0 = var_13; [L94] SORT_12 var_15_arg_1 = var_14; [L95] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L96] SORT_1 var_16_arg_0 = var_11; [L97] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_16_arg_0=-1, var_16_arg_1=1, var_19=1, var_49=1, var_51=4, var_7=0] [L98] EXPR var_16_arg_0 | var_16_arg_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L98] SORT_1 var_16 = var_16_arg_0 | var_16_arg_1; [L99] SORT_1 var_20_arg_0 = var_16; [L100] SORT_1 var_20 = ~var_20_arg_0; [L101] SORT_1 var_21_arg_0 = var_19; [L102] SORT_1 var_21_arg_1 = var_20; VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_21_arg_0=1, var_21_arg_1=-1, var_49=1, var_51=4, var_7=0] [L103] EXPR var_21_arg_0 & var_21_arg_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L103] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L104] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_6=7, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L104] var_21 = var_21 & mask_SORT_1 [L105] SORT_1 bad_22_arg_0 = var_21; [L106] CALL __VERIFIER_assert(!(bad_22_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 712 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 541 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 171 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-14 07:12:00,902 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:12:03,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:12:03,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 07:12:03,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:12:03,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:12:03,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:12:03,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:12:03,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:12:03,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:12:03,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:12:03,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:12:03,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:12:03,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:12:03,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:12:03,214 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:12:03,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:12:03,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:12:03,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:12:03,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:12:03,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:12:03,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:12:03,221 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:12:03,221 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:12:03,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:12:03,221 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:12:03,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:12:03,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:12:03,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:12:03,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:12:03,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:12:03,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:12:03,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:12:03,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:12:03,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:12:03,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:12:03,226 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:12:03,227 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:12:03,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:12:03,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:12:03,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:12:03,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:12:03,229 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:12:03,229 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2024-10-14 07:12:03,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:12:03,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:12:03,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:12:03,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:12:03,606 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:12:03,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2024-10-14 07:12:05,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:12:05,366 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:12:05,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2024-10-14 07:12:05,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97ecc1f4/86c8b87b7bfa4c45abc2c7641674a0f1/FLAGb2a07359a [2024-10-14 07:12:05,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a97ecc1f4/86c8b87b7bfa4c45abc2c7641674a0f1 [2024-10-14 07:12:05,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:12:05,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:12:05,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:12:05,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:12:05,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:12:05,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:12:05" (1/1) ... [2024-10-14 07:12:05,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce1defa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:05, skipping insertion in model container [2024-10-14 07:12:05,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:12:05" (1/1) ... [2024-10-14 07:12:05,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:12:05,937 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2024-10-14 07:12:05,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:12:06,012 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:12:06,049 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2024-10-14 07:12:06,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:12:06,093 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:12:06,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06 WrapperNode [2024-10-14 07:12:06,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:12:06,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:12:06,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:12:06,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:12:06,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,141 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2024-10-14 07:12:06,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:12:06,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:12:06,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:12:06,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:12:06,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:12:06,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:12:06,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:12:06,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:12:06,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:12:06,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (1/1) ... [2024-10-14 07:12:06,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:12:06,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:12:06,240 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-14 07:12:06,243 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-14 07:12:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:12:06,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:12:06,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:12:06,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:12:06,393 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:12:06,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:12:06,609 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-14 07:12:06,610 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:12:06,655 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:12:06,656 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:12:06,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:06 BoogieIcfgContainer [2024-10-14 07:12:06,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:12:06,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:12:06,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:12:06,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:12:06,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:12:05" (1/3) ... [2024-10-14 07:12:06,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a817009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:12:06, skipping insertion in model container [2024-10-14 07:12:06,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:12:06" (2/3) ... [2024-10-14 07:12:06,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a817009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:12:06, skipping insertion in model container [2024-10-14 07:12:06,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:06" (3/3) ... [2024-10-14 07:12:06,669 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2024-10-14 07:12:06,689 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:12:06,690 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:12:06,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:12:06,757 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;@798943b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:12:06,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:12:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 07:12:06,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:06,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 07:12:06,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 07:12:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:06,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299225078] [2024-10-14 07:12:06,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:06,791 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-14 07:12:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:06,794 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-14 07:12:06,796 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-14 07:12:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:06,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 07:12:06,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:12:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:07,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:12:07,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:12:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299225078] [2024-10-14 07:12:07,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299225078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:12:07,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:12:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:12:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338140675] [2024-10-14 07:12:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:12:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:12:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:12:07,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:12:07,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:12:07,143 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:07,195 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 07:12:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:12:07,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 07:12:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:07,205 INFO L225 Difference]: With dead ends: 15 [2024-10-14 07:12:07,206 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 07:12:07,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 07:12:07,212 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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-14 07:12:07,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:12:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 07:12:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 07:12:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 07:12:07,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 07:12:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 07:12:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 07:12:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 07:12:07,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:07,242 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 07:12:07,247 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-14 07:12:07,445 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-14 07:12:07,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:07,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 07:12:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753586199] [2024-10-14 07:12:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:12:07,448 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-14 07:12:07,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:07,451 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-14 07:12:07,452 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-14 07:12:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:12:07,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 07:12:07,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:12:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:07,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:12:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:07,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:12:07,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753586199] [2024-10-14 07:12:07,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753586199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:12:07,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:12:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 07:12:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323963191] [2024-10-14 07:12:07,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:12:07,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:12:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:12:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:12:07,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:12:07,995 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:08,206 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-14 07:12:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:12:08,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 07:12:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:08,207 INFO L225 Difference]: With dead ends: 17 [2024-10-14 07:12:08,207 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 07:12:08,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:12:08,209 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:08,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 07:12:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-14 07:12:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-14 07:12:08,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-14 07:12:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-14 07:12:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-14 07:12:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 07:12:08,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:08,216 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-14 07:12:08,220 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 (3)] Ended with exit code 0 [2024-10-14 07:12:08,418 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-14 07:12:08,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:08,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-14 07:12:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026113012] [2024-10-14 07:12:08,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 07:12:08,421 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-14 07:12:08,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:08,424 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-14 07:12:08,425 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-14 07:12:08,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 07:12:08,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 07:12:08,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 07:12:08,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:12:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:08,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:12:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 07:12:09,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:12:09,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026113012] [2024-10-14 07:12:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026113012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:12:09,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:12:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 07:12:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432055626] [2024-10-14 07:12:09,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:12:09,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 07:12:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:12:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 07:12:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:12:09,924 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:10,937 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-10-14 07:12:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 07:12:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 07:12:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:10,938 INFO L225 Difference]: With dead ends: 31 [2024-10-14 07:12:10,938 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 07:12:10,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:12:10,940 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:10,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:12:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 07:12:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-14 07:12:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-14 07:12:10,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2024-10-14 07:12:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:10,954 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-14 07:12:10,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-14 07:12:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 07:12:10,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:12:10,956 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2024-10-14 07:12:10,960 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-14 07:12:11,159 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-14 07:12:11,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:12:11,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:12:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash 181792434, now seen corresponding path program 3 times [2024-10-14 07:12:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:12:11,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888106082] [2024-10-14 07:12:11,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 07:12:11,164 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-14 07:12:11,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:12:11,168 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-14 07:12:11,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 (5)] Waiting until timeout for monitored process [2024-10-14 07:12:11,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 07:12:11,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 07:12:11,269 WARN L253 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 07:12:11,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:12:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 07:12:12,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:12:17,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|))))))) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_12~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_14~0#1|))) (let ((.cse32 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse12)) .cse10))) .cse9)) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse12 (_ bv2 32))))))))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse33))))))) (.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) .cse33))))))) (.cse3 (not .cse32))) (let ((.cse14 (and (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|)))))))) .cse32) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|)))))) (_ bv0 8))) .cse3))) (.cse15 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_51~0#1|)) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_19~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_49~0#1|))) (and (or (and (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse2))))))) .cse3) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 .cse2))))) (_ bv0 8)))) (let ((.cse5 (= .cse12 .cse15))) (and (or .cse5 (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 .cse13)))))))))) (let ((.cse7 (= .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse8))))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse8 (_ bv2 32))))))))) (and (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|)))))))) .cse7) (or (not .cse7) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 (_ bv1 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|))))))))))))) (or .cse14 (not .cse5)))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|) .cse15)))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 .cse13)))))))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 .cse13)))))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse16 (_ bv2 32))))))) (_ bv1 32)))))))))))))) (= .cse17 .cse15) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse16))))) .cse9)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse18))))) .cse9)) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse18 (_ bv2 32))))))) (_ bv1 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|))))))) (= .cse16 .cse15)))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse13)))))))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 .cse13)))))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse19 (_ bv2 32))))))) (_ bv1 32)))))))))))))) (= .cse20 .cse15) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse19))))) .cse9)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse21))))) .cse9) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse21 (_ bv2 32))))))) (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|)))) .cse0)) (_ bv0 8)) (= .cse19 .cse15)))))) (or .cse14 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse13)))))))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse22 (_ bv2 32))))))) (_ bv1 32)))))))))))))) (= .cse23 .cse15) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse22))))) .cse9)) (not (= .cse22 .cse15)))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse13)))))))))) (or (= .cse24 .cse15) (not (= .cse25 .cse15)) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse25 (_ bv2 32))))))) (_ bv0 32)))))))))))))))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse13)))))))))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse13)))))))))) (or (= .cse26 .cse15) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse27))))) .cse9)) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse27 (_ bv2 32))))))) (_ bv1 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|))))))) (= .cse28 .cse15) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse28 (_ bv2 32))))))) (_ bv0 32))))))))))))))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_32| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse13)))))))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse13)))))))))) (or (= .cse29 .cse15) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse30))))) .cse9) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse30 (_ bv2 32))))))) (_ bv0 32))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_32|)))) .cse0)) (_ bv0 8)) (= .cse31 .cse15) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse31 (_ bv2 32))))))) (_ bv0 32))))))))))))))))))))))))) is different from false [2024-10-14 07:12:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 15 not checked. [2024-10-14 07:12:45,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:12:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888106082] [2024-10-14 07:12:45,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888106082] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:12:45,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:12:45,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-14 07:12:45,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551914355] [2024-10-14 07:12:45,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:12:45,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 07:12:45,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:12:45,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 07:12:45,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-10-14 07:12:45,389 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:12:49,137 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2024-10-14 07:12:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:12:49,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 07:12:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:12:49,139 INFO L225 Difference]: With dead ends: 26 [2024-10-14 07:12:49,139 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 07:12:49,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=61, Invalid=152, Unknown=1, NotChecked=26, Total=240 [2024-10-14 07:12:49,140 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:12:49,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:12:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 07:12:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 07:12:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 07:12:49,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-10-14 07:12:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:12:49,142 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 07:12:49,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 07:12:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 07:12:49,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 07:12:49,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:12:49,152 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-14 07:12:49,349 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-14 07:12:49,352 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-14 07:12:49,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 07:12:53,576 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:12:53,589 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 07:12:53,590 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-14 07:12:53,591 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-14 07:12:53,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:12:53 BoogieIcfgContainer [2024-10-14 07:12:53,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:12:53,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:12:53,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:12:53,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:12:53,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:12:06" (3/4) ... [2024-10-14 07:12:53,598 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 07:12:53,606 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-14 07:12:53,606 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 07:12:53,607 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 07:12:53,607 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 07:12:53,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 07:12:53,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 07:12:53,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:12:53,713 INFO L158 Benchmark]: Toolchain (without parser) took 47983.27ms. Allocated memory was 86.0MB in the beginning and 197.1MB in the end (delta: 111.1MB). Free memory was 56.7MB in the beginning and 107.2MB in the end (delta: -50.5MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-10-14 07:12:53,713 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:12:53,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.74ms. Allocated memory is still 86.0MB. Free memory was 56.4MB in the beginning and 64.4MB in the end (delta: -8.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-14 07:12:53,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.36ms. Allocated memory is still 86.0MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:12:53,714 INFO L158 Benchmark]: Boogie Preprocessor took 58.41ms. Allocated memory is still 86.0MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:12:53,714 INFO L158 Benchmark]: RCFGBuilder took 455.52ms. Allocated memory is still 86.0MB. Free memory was 59.8MB in the beginning and 43.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 07:12:53,715 INFO L158 Benchmark]: TraceAbstraction took 46933.88ms. Allocated memory was 86.0MB in the beginning and 197.1MB in the end (delta: 111.1MB). Free memory was 43.0MB in the beginning and 112.5MB in the end (delta: -69.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2024-10-14 07:12:53,715 INFO L158 Benchmark]: Witness Printer took 117.08ms. Allocated memory is still 197.1MB. Free memory was 112.5MB in the beginning and 107.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:12:53,716 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.74ms. Allocated memory is still 86.0MB. Free memory was 56.4MB in the beginning and 64.4MB in the end (delta: -8.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.36ms. Allocated memory is still 86.0MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.41ms. Allocated memory is still 86.0MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.52ms. Allocated memory is still 86.0MB. Free memory was 59.8MB in the beginning and 43.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 46933.88ms. Allocated memory was 86.0MB in the beginning and 197.1MB in the end (delta: 111.1MB). Free memory was 43.0MB in the beginning and 112.5MB in the end (delta: -69.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * Witness Printer took 117.08ms. Allocated memory is still 197.1MB. Free memory was 112.5MB in the beginning and 107.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.6s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 6 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 69 ConstructedInterpolants, 32 QuantifiedInterpolants, 16684 SizeOfPredicates, 26 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 21/86 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((((((((0 == var_7) && (3 == mask_SORT_12)) && (1 == var_19)) && (1 == var_49)) && (0 == var_14)) && (1 == mask_SORT_1)) && (4 == var_51)) && (7 == mask_SORT_6)) RESULT: Ultimate proved your program to be correct! [2024-10-14 07:12:53,928 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-14 07:12:54,116 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE